A new VRPPD model and a hybrid heuristic solution approach for e-tailing
From MaRDI portal
Publication:2514740
DOI10.1016/j.ejor.2013.05.023zbMath1304.90048OpenAlexW2163268944MaRDI QIDQ2514740
Ronan deKervenoael, Seda Yanik, Burçin Bozkaya
Publication date: 3 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.05.023
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
An optimisation approach for the e-grocery order picking and delivery problem ⋮ An adaptive large neighborhood search for an E-grocery delivery routing problem ⋮ Facilitating consumer preferences and product shelf life data in the design of e-grocery deliveries
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up
- Real-time split-delivery pickup and delivery time window problems with transfers
- A GIS-based optimization framework for competitive multi-facility location-routing problem
- An algorithm for the traveling salesman problem with pickup and delivery customers
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms
- A grouping genetic algorithm for the pickup and delivery problem with time windows
- The precedence-constrained asymmetric traveling salesman polytope
- A dial-a-ride problem for client transportation in a health-care organization
- A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
- A location-routing problem for the conversion to the ``click-and-mortar retailing: the static case
- The dial-a-ride problem: Models and algorithms
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
- Genetic Algorithms
- The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
This page was built for publication: A new VRPPD model and a hybrid heuristic solution approach for e-tailing
