Solving a vehicle-routing problem arising in soft-drink distribution
From MaRDI portal
Publication:3182656
DOI10.1057/palgrave.jors.2602087zbMath1171.90341OpenAlexW1966197055MaRDI QIDQ3182656
Fayez F. Boctor, J. Privé, Jacques Renaud, Gilbert Laporte
Publication date: 15 October 2009
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602087
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items
Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015, The multi-vehicle profitable pickup and delivery problem, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows, General solutions to the single vehicle routing problem with pickups and deliveries, A branch-and-price algorithm for a routing problem with inbound and outbound requests, One-to-Many-to-One Single Vehicle Pickup and Delivery Problems, The single vehicle routing problem with deliveries and selective pickups, A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows, Industrial aspects and literature survey: fleet composition and routing, Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet, Lasso solution strategies for the vehicle routing problem with pickups and deliveries, An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
