A new VRPPD model and a hybrid heuristic solution approach for e-tailing
DOI10.1016/J.EJOR.2013.05.023zbMATH Open1304.90048OpenAlexW2163268944MaRDI QIDQ2514740FDOQ2514740
Authors: Ronan deKervenoael, Seda Yanik, Burcin 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
Recommendations
- An adaptive large neighborhood search for an E-grocery delivery routing problem
- A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain
- CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up
- A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
- A hybrid heuristic based on general variable neighborhood search for the single vehicle routing problem with deliveries and selective pickups
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up
- A grouping genetic algorithm for the pickup and delivery problem with time windows
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- A GIS-based optimization framework for competitive multi-facility location-routing problem
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms
- A location-routing problem for the conversion to the ``click-and-mortar retailing: the static case
- The dial-a-ride problem: Models and algorithms
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Title not available (Why is that?)
- The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- Real-time split-delivery pickup and delivery time window problems with transfers
- A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
- Recent models and algorithms for one-to-one pickup and delivery problems
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
- Title not available (Why is that?)
- The precedence-constrained asymmetric traveling salesman polytope
- 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
- Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- A dial-a-ride problem for client transportation in a health-care organization
- Genetic Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- An algorithm for the traveling salesman problem with pickup and delivery customers
- 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
- Title not available (Why is that?)
Cited In (3)
Uses Software
This page was built for publication: A new VRPPD model and a hybrid heuristic solution approach for e-tailing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2514740)
