Related references
Note: Only part of the references are listed.Memetic search for the minmax multiple traveling salesman problem with single and multiple depots
Pengfei He et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2023)
Hybrid genetic search for the CVRP: Open-source implementation and SWAP* neighborhood
Thibaut Vidal
COMPUTERS & OPERATIONS RESEARCH (2022)
General Edge Assembly Crossover-Driven Memetic Search for Split Delivery Vehicle Routing
Pengfei He et al.
TRANSPORTATION SCIENCE (2022)
A Branch-and-Cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman Problem
Glaubos Climaco et al.
RAIRO-OPERATIONS RESEARCH (2021)
Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
Alice Paul et al.
MATHEMATICS OF OPERATIONS RESEARCH (2020)
A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
Farouk Hammami et al.
COMPUTERS & OPERATIONS RESEARCH (2020)
An adaptive large neighbourhood search algorithm for the orienteering problem
Alberto Santini
EXPERT SYSTEMS WITH APPLICATIONS (2019)
An efficient evolutionary algorithm for the orienteering problem
Gorka Kobeaga et al.
COMPUTERS & OPERATIONS RESEARCH (2018)
Evolution-inspired local improvement algorithm solving orienteering problem
Krzysztof Ostrowski et al.
ANNALS OF OPERATIONS RESEARCH (2017)
A novel GRASP solution approach for the Orienteering Problem
Morteza Keshtkaran et al.
JOURNAL OF HEURISTICS (2016)
Large Neighborhoods with Implicit Customer Selection for Vehicle Routing Problems with Profits
Thibaut Vidal et al.
TRANSPORTATION SCIENCE (2016)
A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem
Yannis Marinakis et al.
MODELLING, COMPUTATION AND OPTIMIZATION IN INFORMATION SYSTEMS AND MANAGEMENT SCIENCES - MCO 2015 - PT II (2015)
A unified solution framework for multi-attribute vehicle routing problems
Thibaut Vidal et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2014)
GRASP with path relinking for the orienteering problem
Vicente Campos et al.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2014)
A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
Thibaut Vidal et al.
COMPUTERS & OPERATIONS RESEARCH (2013)
A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem
Yuichi Nagata et al.
INFORMS JOURNAL ON COMPUTING (2013)
A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
Thibaut Vidal et al.
OPERATIONS RESEARCH (2012)
The orienteering problem: A survey
Pieter Vansteenwegen et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2011)
A memetic algorithm for the team orienteering problem
Hermann Bouly et al.
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH (2010)
A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
Yuichi Nagata et al.
COMPUTERS & OPERATIONS RESEARCH (2010)
The effective application of a new approach to the generalized orienteering problem
John Silberholz et al.
JOURNAL OF HEURISTICS (2010)
Planning in tourism and public transportation
Pieter Vansteenwegen
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH (2009)
Edge Assembly-Based Memetic Algorithm for the Capacitated Vehicle Routing Problem
Yuichi Nagata et al.
NETWORKS (2009)
A Branch-and-Cut Algorithm for the Undirected Prize Collecting Traveling Salesman Problem
Jean-Francois Berube et al.
NETWORKS (2009)
State-of-the Art Review Evolutionary Algorithms for Vehicle Routing
Jean-Yves Potvin
INFORMS JOURNAL ON COMPUTING (2009)
Traveling salesman problems with profits
D Feillet et al.
TRANSPORTATION SCIENCE (2005)
A simple and effective evolutionary algorithm for the vehicle routing problem
C Prins
COMPUTERS & OPERATIONS RESEARCH (2004)
New trends in exact algorithms for the 0-1 knapsack problem
S Martello et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2000)
Share Paper
