A unified matheuristic for solving multi-constrained traveling salesman problems with profits

DOI10.1007/s13675-016-0071-1zbMath1390.90075OpenAlexW2470965158MaRDI QIDQ1707083

Rahma Lahyani, Frédéric Semet, Mahdi Khemakhem

Publication date: 28 March 2018

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01663624/file/Version1.pdf

zbMATH Keywords

matheuristicorienteering problemapproximate routing neighborhoodsexact loading neighborhoodsorienteering problem with time windowprofitable tour problem with compartments

Mathematics Subject Classification ID

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

Related Items (5)

FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM ⋮ Prize-collecting asymmetric traveling salesman problem admits polynomial time approximation within a constant ratio ⋮ Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics ⋮ Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions ⋮ A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rich vehicle routing problems: from a taxonomy to a definition
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
• A simulated annealing heuristic for the team orienteering problem with time windows
• Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
• The orienteering problem: a survey
• Vehicle routing with compartments: applications, modelling and heuristics
• Heuristics for the multi-period orienteering problem with multiple time windows
• Iterated local search for the team orienteering problem with time windows
• A general heuristic for vehicle routing problems
• The selective travelling salesman problem
• The petrol station replenishment problem with time windows
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
• A fast and effective heuristic for the orienteering problem
• Variable neighborhood search
• A tabu search heuristic for the undirected selective travelling salesman problem
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
• Algorithmic graph theory and perfect graphs
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• Record breaking optimization results using the ruin and recreate principle
• An adaptive large neighborhood search heuristic for the pollution-routing problem
• A guided local search metaheuristic for the team orienteering problem
• A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
• A unified solution framework for multi-attribute vehicle routing problems
• A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
• The capacitated team orienteering and profitable tour problems
• The Knapsack Problem with Conflict Graphs
• The orienteering problem
• The prize collecting traveling salesman problem
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• On the Significance of the Initial Solution in Travelling Salesman Heuristics
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A guide to vehicle routing heuristics
• On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
• Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows

This page was built for publication: A unified matheuristic for solving multi-constrained traveling salesman problems with profits