A new VRPPD model and a hybrid heuristic solution approach for e-tailing

DOI10.1016/J.EJOR.2013.05.023MaRDI QIDQ2514740zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

genetic algorithmGIShybrid heuristicVRP with pickup and deliveries and time windows

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

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

Cites work

• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• A dial-a-ride problem for client transportation in a health-care organization
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• A GIS-based optimization framework for competitive multi-facility location-routing problem
• A grouping genetic algorithm for the pickup and delivery problem with time windows
• A location-routing problem for the conversion to the ``click-and-mortar retailing: the static case
• A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
• 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
• An Additive Bounding Procedure for Combinatorial Optimization Problems
• An algorithm for the traveling salesman problem with pickup and delivery customers
• An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
• CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up
• Genetic Algorithms
• Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
• Heuristic Algorithms for the Handicapped Persons Transportation Problem
• scientific article; zbMATH DE number 1054963 (Why is no real title available?)
• scientific article; zbMATH DE number 1749228 (Why is no real title available?)
• scientific article; zbMATH DE number 1361564 (Why is no real title available?)
• scientific article; zbMATH DE number 1859348 (Why is no real title available?)
• scientific article; zbMATH DE number 906535 (Why is no real title available?)
• Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
• Models, relaxations and exact approaches for the capacitated vehicle routing problem
• Real-time split-delivery pickup and delivery time window problems with transfers
• Recent models and algorithms for one-to-one pickup and delivery problems
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• The dial-a-ride problem: Models and algorithms
• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
• The precedence-constrained asymmetric traveling salesman polytope
• Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows

Cited in

(3)

• An optimisation approach for the e-grocery order picking and delivery problem
• Facilitating consumer preferences and product shelf life data in the design of e-grocery deliveries
• An adaptive large neighborhood search for an E-grocery delivery routing problem

Describes a project that uses

Uses Software

• CLOVES
• VRP

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)