Location-Routing Problem With Demand Range
This research proposes a new variant of the location-routing problem (LRP) called LRP with Demand Range (LRPDR) by allowing flexibility in the delivery quantity. The goal of the LRPDR is to minimize the objective value calculated by the total cost minus the extra revenue. The total cost consists of...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8862809/ |