An Adaptive Large Neighborhood Search for an E-grocery Delivery Routing Problem
Computers & Operations Research, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ugur Emeç +2 more
openaire +4 more sources
Hybrid Adaptive Large Neighborhood Search for the Optimal Statistic Median Problem
Computers & Operations Research, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Klemens Katterbauer +2 more
openaire +1 more source
Adaptive large neighborhood search for the curriculum-based course timetabling problem
Annals of Operations Research, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexander Kiefer +2 more
openaire +2 more sources
Adaptive large neighborhood search for service technician routing and scheduling problems
Journal of Scheduling, 2011Motivated by the problem situation faced by infrastructure service and maintenance providers, we define the service technician routing and scheduling problem with and without team building: a given number of technicians have to complete a given number of service tasks.
Attila A. Kovacs +3 more
openaire +3 more sources
An adaptive large neighborhood search for the robust rig routing
Expert Systems with Applications, 2023Igor Kulachenko, Polina A. Kononova
openaire +2 more sources
An Adaptive Large Neighborhood Search for the Periodic Vehicle Routing Problem
2017In this paper, an Adaptive Large Neighborhood Search (ALNS) is proposed for the Periodic Vehicle Routing Problem (PVRP). Each customer requires service on one or more days on a pre-defined time horizon. They must be assigned to feasible visit options and Vehicle Routing Problems (VRP) need to be solved for each day.
openaire +1 more source
An adaptive large neighborhood search for a vehicle routing problem with multiple routes
Computers & Operations Research, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nabila Azi +2 more
openaire +2 more sources
A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
Computers & Operations Research, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yuan Qu, Jonathan F. Bard
openaire +2 more sources
An adaptive large neighborhood search heuristic for dynamic vehicle routing problems
Computers & Electrical Engineering, 2018Abstract The vehicle routing in real-life transportation, distribution and logistics may change with time, especially when there is existing technology that can produce real-time routing data. In this paper, a metaheuristic procedure based on an Adaptive Large Neighborhood Search (ALNS) algorithm is proposed to solve the Dynamic Vehicle Routing ...
Shifeng Chen +4 more
openaire +2 more sources
Planning a selective delivery schedule through Adaptive Large Neighborhood Search
Computers & Industrial Engineering, 2017Abstract We model and solve a real-life distribution problem faced by a fresh fruit supplier. This problem is formulated as a Multi-Product Split Delivery Capacitated Team Orienteering Problem with Incomplete Service and Soft Time Windows. The problem is modeled through a mixed integer linear programming formulation and solved by an Adaptive Large ...
Pamela J. Palomo-Martínez +2 more
openaire +2 more sources