The Distribution Problem with Carrier Service: A Dual Based Penalty Approach

DOI10.1287/IJOC.7.1.24MaRDI QIDQ4835446zbMATH OpenOpenAlexFDO

Authors

Publication date 1 June 1995

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.7.1.24

zbMATH Keywords

vehicle routingvalid inequalitiesorder schedulingreal-world data

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Recommendations

• Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector
• Approximative solutions to the bicriterion vehicle routing problem with time windows
• A heuristic algorithm for the routing and scheduling problem with time windows: a case study of the automotive industry in Mexico
• Modeling the vehicle routing problem for a soft drink distribution company
• Vehicle routing problem in real case application

Cited in

(8)

• A dual approach for solving the combined distribution and assignment problem with link capacity constraints
• Collaborative model and algorithms for supporting real-time distribution logistics system
• A heuristic algorithm for the routing and scheduling problem with time windows: a case study of the automotive industry in Mexico
• Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector
• A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
• A TABU search heuristic for the team orienteering problem
• Research on multi-trip vehicle routing problem and distribution center location problem
• A heuristic for the routing and carrier selection problem

This page was built for publication: The Distribution Problem with Carrier Service: A Dual Based Penalty Approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4835446)