The supply of convenience stores: challenges of short-distance routing within the constraints of working time regulations
From MaRDI portal
Publication:6556096
DOI10.1016/j.ejor.2023.11.004MaRDI QIDQ6556096
Publication date: 17 June 2024
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- The multi-compartment vehicle routing problem with flexible compartment sizes
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- A rich vehicle routing problem dealing with perishable food: a case study
- Vehicle routing with compartments: applications, modelling and heuristics
- A general heuristic for vehicle routing problems
- The vehicle routing problem. Latest advances and new challenges.
- On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
- A bi-criteria heuristic for the vehicle routing problem with time windows
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- Scheduling deliveries in vehicles with multiple compartments
- Product-oriented time window assignment for a multi-compartment vehicle routing problem
- Vehicle selection for a multi-compartment vehicle routing problem
- Truck driver scheduling in Australia
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- Optimizing routing and delivery patterns with multi-compartment vehicles
- Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions
- A multi-compartment vehicle routing problem in cold-chain distribution
- Bidirectional labeling for solving vehicle routing and truck driver scheduling problems
- Retail supply chain management. Quantitative models and empirical studies
- Waste collection vehicle routing problem with time windows
- Drive: Dynamic Routing of Independent Vehicles
- A template-based adaptive large neighborhood search for the consistent vehicle routing problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
- Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
This page was built for publication: The supply of convenience stores: challenges of short-distance routing within the constraints of working time regulations