A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services

DOI10.1051/ro/2018024zbMath1411.90044OpenAlexW2794185206WikidataQ130183238 ScholiaQ130183238MaRDI QIDQ4634326

Hayet Chentli, Wahiba Ramdane Cherif-Khettaf, Rachid Ouafi

Publication date: 7 May 2019

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2018024

zbMATH Keywords

metaheuristicsadaptive large neighborhood searchreverse logisticprofitable tour problemvehicle routing problem with pickup and delivery

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

A survey of adaptive large neighborhood search algorithms and applications ⋮ Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search ⋮ An adaptive large neighborhood search algorithm for vehicle routing problem with multiple time windows constraints

Uses Software

• CPLEX
• VRP

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
• A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
• An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• A unified heuristic for a large class of vehicle routing problems with backhauls
• A general heuristic for vehicle routing problems
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
• An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
• Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem
• A branch-and-cut algorithm for the capacitated profitable tour problem
• The multi-vehicle profitable pickup and delivery problem
• The single vehicle routing problem with deliveries and selective pickups
• 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
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
• The capacitated team orienteering and profitable tour problems

This page was built for publication: A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services