Models and algorithms for the Traveling Salesman Problem with Time-dependent Service times

Cacchiani, Valentina; Contreras‐Bolton, Carlos; Toth, Paolo

doi:10.1016/j.ejor.2019.11.046

Cited by 23 publications

(16 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Equation 10links the passage by node i at step s with the service of node i at step s. Also Equation 11links the passage on link (i, j) at step s with the service of the required link (i,j) at step s by the same vehicle. Constraints (12) ensure that a required link is served at only one step. Constraints (13) guarantee that the number of steps for each vehicle is equal to the number of traversed links.…”

Section: Mathematical Formulationmentioning

confidence: 99%

“…Hence its application arises in different fields: route planning on road networks, travel planning in public transit networks, and also in some robotic and military applications [20]. In particular, time-dependent vehicle routing problems have been widely studied in the literature with different variants of time dependency: service time (e.g., Malandraki and Daskin [29], Ichoua et al [21], Donati et al [18]), time windows (e.g., Dabia et al [16], Jung and Haghani [23], Balseiro et al [6], Adamo et al [1], Cacchiani et al [12]), demand (e.g., Victoria et al [46]). For more details we refer the reader to Mourão and Pinto [31] and Gendreau et al [20].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

The mixed capacitated general routing problem with time‐dependent demands

Ahabchane

Trépanier

2020

Networks

View full text Add to dashboard Cite

The mixed capacitated general routing problem (MCGRP) is defined over a mixed graph, for which some nodes, arcs, and edges must be serviced. The problem consists of determining a set of routes of minimum cost that satisfy the demand. Some problems like salt spreading have a time-dependent demand which was ignored in the previous studies. This variation of demand is due to the weather or traffic conditions. This study presents a mixed integer programming model without graph transformation to node routing. We use CPLEX to solve small instances and we develop a Slack Induction by String Removals metaheuristic for large instances adapted to this problem. The proposed model and metaheuristic were tested on problems derived from a set of classical instances of the MCGRP with some modifications to include time-dependent demands.

show abstract

Section: Mathematical Formulationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

The mixed capacitated general routing problem with time‐dependent demands

Ahabchane

Trépanier

2020

Networks

View full text Add to dashboard Cite

show abstract

“…Según Cacchiani, Contreras-Bolton, & Toth (2020) en muchas situaciones prácticas del TSP la consideración del tiempo de servicio tiempo dependiente es relevante, ya que factores como el personal disponible para el cargue/descargue de vehículos o la dificultad de acceso a algunos nodos en determinadas horas del día, hacen que los tiempos de servicios difieran de ciertas horas a otras, invalidando el supuesto de tiempos constantes y aportando complejidad al problema. Según Taş et al (2016), la consideración de la dependencia temporal conlleva a la definición de una función de tiempos de servicio que generalmente es no lineal y que debe involucrarse en el modelo al cual también se le adiciona un conjunto de variables !…”

Section: Introductionunclassified

“…Según Taş et al (2016), la consideración de la dependencia temporal conlleva a la definición de una función de tiempos de servicio que generalmente es no lineal y que debe involucrarse en el modelo al cual también se le adiciona un conjunto de variables ! definidas como el tiempo de llegada al nodo i, así como el conjunto de restricciones que rigen el comportamiento de estas, teniendo como resultado un modelo más robusto y no lineal que evidencia la complejidad del tipo NP-Hard del problema (Cacchiani et al, 2020).…”

Section: Introductionunclassified

Ruteo con servicio tiempo dependiente y penalizaciones por espera y por pérdida de ventas

OSORIO¹,

BRAVO-BASTIDAS²,

Orejuela³

2021

Espacios

View full text Add to dashboard Cite

Se presenta un modelo para la optimización del ruteo en la recogida de ítems perecederos, optmizando el tiempo de inicio de la ruta, considerando tiempos de servicio y pérdidas de ventas tiempo-dependientes. Se consideran además los gastos asociados al mantenimiento del producto refrigerado, y se prueba el modelo en un caso real en un proceso de recogida, descargue en deposito y venta de leche en un municipio de Colombia, comprobando la utilidad del modelo con el uso de escenarios.

show abstract

“…In the literature, there are several variations of TSP that are analyzed by the researchers. For example, Cacchiani et al [2] analyzes TSP for timedependent service times. TSP can be seen as a subproblem of vehicle routing problems (Ex.…”

Section: Introductionmentioning

confidence: 99%

Analysis of TSP: Simulated Annealing and Genetic Algorithm Approaches

Botsalı

Alaykiran

2020

International Journal of Computational and Experimental Science and Engineering

View full text Add to dashboard Cite

This paper analyzes the performance of the popular heuristic methods 'Simulated Annealing (SA)' and 'Genetic Algorithm (GA)' on the symmetric TSP. TSP is a well-known combinatorial optimization problem in NP-complete class. NP-completeness of TSP originates many specific approximation algorithms to find optimal or near optimal solutions in a reasonable time. On the other hand, both SA and GA are general purpose heuristic methods that are applicable to almost every kind of problem whose solution lies inside a search space. The performance of SA and GA depends on many factors such as the nature of the problem, design of the algorithm, parameter values, etc. In this paper, a GA and an SA algorithm are given and their performance with respect to several factors is analyzed. The algorithms are tested on some benchmark problems (TSPLIB) which are obtainable via Internet from

show abstract

Models and algorithms for the Traveling Salesman Problem with Time-dependent Service times

Cited by 23 publications

References 30 publications

The mixed capacitated general routing problem with time‐dependent demands

The mixed capacitated general routing problem with time‐dependent demands

Ruteo con servicio tiempo dependiente y penalizaciones por espera y por pérdida de ventas

Analysis of TSP: Simulated Annealing and Genetic Algorithm Approaches

Contact Info

Product

Resources

About