A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem

DOI10.1007/S10479-020-03789-0MaRDI QIDQ2675709zbMATH OpenOpenAlexFDO

Authors Juan D. Palacio, Juan Carlos Rivera

Publication date 26 September 2022

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-020-03789-0

zbMATH Keywords

bicycle repositioning problemevolutionary local searchpickup and delivery traveling salesman problemvariable neighborhood descent

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1953194
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
• A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
• A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms

Cites work

• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• A destroy and repair algorithm for the bike sharing rebalancing problem
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
• A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
• A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
• Bike sharing systems: solving the static rebalancing problem
• Computer Solutions of the Traveling Salesman Problem
• Dynamic repositioning strategy in a bike-sharing system; how to prioritize and how to rebalance a bike station
• Greedy randomized adaptive search procedures
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• Improvements to the Or-opt heuristic for the symmetric travelling salesman problem
• Integer Programming Formulation of Traveling Salesman Problems
• Optimization by GRASP. Greedy randomized adaptive search procedures
• Variable neighborhood search: basics and variants
• Variable neighborhood search: Principles and applications

Cited in

(3)

• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem: A matheuristic
• A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem

This page was built for publication: A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2675709)