An adaptive large neighborhood search for an E-grocery delivery routing problem
From MaRDI portal
Publication:342326
DOI10.1016/j.cor.2015.11.008zbMath1349.90085MaRDI QIDQ342326
Burçin Bozkaya, Uğur Emeç, Bülent Çatay
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.11.008
vehicle routing problem with time windowsadaptive large neighborhood searchE-grocery delivery routing problemhome delivery servicespremium customerpremium good
Related Items
The study of joint order batching and picker routing problem with food and nonfood category constraint in online‐to‐offline grocery store, An adaptive large neighbourhood search for asset protection during escaped wildfires, Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities, Electric vehicle routing problem with time-dependent waiting times at recharging stations, A matheuristic method for the electric vehicle routing problem with time windows and fast chargers, Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search, 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, The vehicle routing problem with simultaneous pickup and delivery and handling costs, A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem
- An adaptive large neighborhood search for a vehicle routing problem with multiple routes
- Lower and upper bounds for the two-echelon capacitated location-routing problem
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
- Scheduling technicians and tasks in a telecommunications company
- A unified heuristic for a large class of vehicle routing problems with backhauls
- CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up
- A general heuristic for vehicle routing problems
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- The periodic vehicle routing problem with intermediate facilities
- A time-based pheromone approach for the ant system
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- The consultation timetabling problem at Danish high schools
- A dial-a-ride problem for client transportation in a health-care organization
- A new VRPPD model and a hybrid heuristic solution approach for e-tailing
- 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
- A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities
- A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
