Product-oriented time window assignment for a multi-compartment vehicle routing problem
From MaRDI portal
Publication:1734344
DOI10.1016/j.ejor.2019.01.053zbMath1430.90110OpenAlexW2914374758MaRDI QIDQ1734344
Alexander Hübner, Pedro Amorim, Sara Martins, Manuel Ostermeier, Bernardo Almada-Lobo
Publication date: 27 March 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-923265
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items
An optimisation approach for the e-grocery order picking and delivery problem, Vehicle routing for milk collection with gradual blending: a case arising in Chile, Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order, A two‐stage method for the shipper lane selection problem with time windows in transportation service procurement, A hybrid ant colony optimization algorithm for multi-compartment vehicle routing problem, Optimizing routing and delivery patterns with multi-compartment vehicles, Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions
Cites Work
- The discrete time window assignment vehicle routing problem
- The multi-compartment vehicle routing problem with flexible compartment sizes
- The multi-objective generalized consistent vehicle routing problem
- A branch-and-cut framework for the consistent traveling salesman problem
- Delivery pattern and transportation planning in grocery retailing
- A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
- Vehicle routing with compartments: applications, modelling and heuristics
- A general heuristic for vehicle routing problems
- A heuristic for the multi-period petrol station replenishment problem
- On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
- Solving a fuel delivery problem by heuristic and exact approaches.
- Scheduling deliveries in vehicles with multiple compartments
- Vehicle selection for a multi-compartment vehicle routing problem
- Vehicle routing problem for multiple product types, compartments, and trips with soft time windows
- Data-driven assignment of delivery patterns with handling effort considerations in retail
- Self-imposed time windows in vehicle routing problems
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- Classification, models and exact algorithms for multi-compartment delivery problems
- A template-based adaptive large neighborhood search for the consistent vehicle routing problem
