A branch-and-price algorithm for a vehicle routing with demand allocation problem

DOI10.1016/j.ejor.2018.06.049zbMath1403.90161OpenAlexW2854471438WikidataQ129594371 ScholiaQ129594371MaRDI QIDQ1991157

Ahmed F. Ghoniem, Mohammad Reihaneh

Publication date: 30 October 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.06.049

zbMATH Keywords

dynamic programmingbranch-and-priceroutingvehicle routing-allocation problemlogistics and distribution

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39)

Related Items

Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order ⋮ An exact solution method for home health care scheduling with synchronized services ⋮ Patient appointment scheduling at hemodialysis centers: an exact branch and price approach ⋮ Research on coordination and optimization of order allocation and delivery route planning in take-out system ⋮ A directional heuristics pulse algorithm for a two resources constrained shortest path problem with reinitialization ⋮ Efficient formulation for transportation scheduling of single refinery multiproduct pipelines ⋮ An exact algorithm for the redundancy allocation problem with heterogeneous components under the mixed redundancy strategy ⋮ A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak

Uses Software

• CPLEX
• VRP

Cites Work

• Unnamed Item
• Efficient elementary and restricted non-elementary route pricing
• The stop-and-drop problem in nonprofit food distribution networks
• A heuristic procedure for the capacitated \(m\)-ring-star problem
• A tutorial on column generation and branch-and-price for vehicle routing problems
• Location-routing: issues, models and methods
• Complementary column generation and bounding approaches for set partitioning formulations
• Logic-based Benders decomposition
• Variable neighborhood tabu search and its application to the median cycle problem.
• A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
• The vehicle routing-allocation problem: A unifying framework
• Locating median cycles in networks
• An adaptive VNS algorithm for vehicle routing problems with intermediate stops
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Waste collection vehicle routing problem with time windows
• Accelerated label setting algorithms for the elementary resource constrained shortest path problem
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
• A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities
• Improving Discrete Model Representations via Symmetry Considerations
• Optimal routing and process scheduling for a mobile service facility
• The Capacitated m-Ring-Star Problem
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• A tabu search algorithm for the single vehicle routing allocation problem
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• The Covering Tour Problem
• The U.S. Army National Guard's Mobile Training Simulators Location and Routing Problem
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Efficient heuristics for Median Cycle Problems
• The Covering Salesman Problem

This page was built for publication: A branch-and-price algorithm for a vehicle routing with demand allocation problem