Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms
type: Item
instance of: scholarly article
title: Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms
zbMATH Open document ID: 1458.90141
author: Bruno C. Silva
author: Islame F. C. Fernandes
author: Marco Cesar Goldbarg
author: Elizabeth Ferreira Gouvêa Goldbarg
published in: Computers \& Operations Research
publication date: 2021-04-20T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7335574
zbMATH Keywords: travelling salesman
zbMATH Keywords: integer programming
zbMATH Keywords: transportation
zbMATH Keywords: meta-heuristics
zbMATH Keywords: shared mobility
describes a project that uses: Gurobi
describes a project that uses: TSPLIB
describes a project that uses: irace
MaRDI profile type: MaRDI publication profile
full work available at URL: j.cor.2020.104950
OpenAlex ID: W3015120250
cites work: Optimization for dynamic ride-sharing: a review
cites work: New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
cites work: The dial-a-ride problem: Models and algorithms
cites work: A method for solving traveling-salesman problems
cites work: The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
cites work: A probabilistic heuristic for a computationally difficult set covering problem
cites work: On the Computational Complexity of Combinatorial Problems
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: Solving a selective dial-a-ride problem with logic-based Benders decomposition
cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem
cites work: The General Pickup and Delivery Problem
cites work: A combined approach to solve the pickup and delivery selection problem
cites work: Enhancing urban mobility: integrating ride-sharing and public transit
cites work: New benchmark instances for the capacitated vehicle routing problem
DOI: 10.1016/J.COR.2020.104950
Recommended article: An ant colony system approach for variants of the traveling salesman problem with time windows
Recommended article: A modified ant colony system for solving the travelling salesman problem with time windows
Recommended article: The traveling salesman problem with pickup, delivery, and ride-time constraints
Recommended article: An ant colony algorithm for time-dependent vehicle routing problem with time windows
Recommended article: The traveling salesman problem with time-dependent service times
description: scientific article; zbMATH DE number 7335574