Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms
DOI10.1016/j.cor.2020.104950zbMath1458.90141OpenAlexW3015120250MaRDI QIDQ2664292
Islame F. C. Fernandes, Marco Cesar Goldbarg, Elizabeth Ferreira Gouvêa Goldbarg, Bruno C. Silva
Publication date: 20 April 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.104950
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- A probabilistic heuristic for a computationally difficult set covering problem
- Enhancing urban mobility: integrating ride-sharing and public transit
- Solving a selective dial-a-ride problem with logic-based Benders decomposition
- New benchmark instances for the capacitated vehicle routing problem
- Optimization for dynamic ride-sharing: a review
- The dial-a-ride problem: Models and algorithms
- Integer Programming Formulation of Traveling Salesman Problems
- TSPLIB—A Traveling Salesman Problem Library
- On the Computational Complexity of Combinatorial Problems
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
- The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
- The General Pickup and Delivery Problem
- A Method for Solving Traveling-Salesman Problems
This page was built for publication: Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms
