2010
DOI: 10.1016/j.eswa.2009.06.077
|View full text |Cite
|
Sign up to set email alerts
|

A note on the truck and trailer routing problem

Abstract: This study considers a relaxation of the truck and trailer routing problem (TTRP), called the relaxed truck and trailer routing problem (RTTRP). In the TTRP, the number of available vehicles, namely trucks and trailers, is limited. Since there are no fixed costs associated with the trucks or trailers, it is reasonable to relax this fleet size constraint. Besides, most benchmark instances for the capacitated vehicle routing problem (VRP) do not have fleet size constraints. We developed a simulated annealing heu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2013
2013
2018
2018

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 46 publications
(29 citation statements)
references
References 24 publications
0
14
0
Order By: Relevance
“…In paper [24], authors proposed a model based on fuzzy logic that assigns different types of vehicles to planned transport tasks. The important savings of transport costs can be achieved through the vehicle routing improvements [25,26]. According to [13], many of operational measures involve use of more advanced systems of information technology, which can support and improve vehicle routing, scheduling operations and return loading.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In paper [24], authors proposed a model based on fuzzy logic that assigns different types of vehicles to planned transport tasks. The important savings of transport costs can be achieved through the vehicle routing improvements [25,26]. According to [13], many of operational measures involve use of more advanced systems of information technology, which can support and improve vehicle routing, scheduling operations and return loading.…”
Section: Literature Reviewmentioning
confidence: 99%
“…On the extensions of the TTRP, Villegas et al [23] proposed two metaheuristics to solve the single truck and trailer routing problem with satellite depots (STTRPSD). Considering the number of available trucks and trailers being limited in the TTRP, Lin et al [24] relaxed the fleet size constraint and developed a SA heuristic for solving the relaxed truck and trailer routing problem (RTTRP). Lin et al [25] proposed a SA heuristic for solving the truck and trailer routing problem with time windows (TTRPTW).…”
Section: The Literature Reviewmentioning
confidence: 99%
“…The SA algorithm is one of the commonly used metaheuristics and has been successfully applied to solve several types of the VRP. Motivated by the success of the SA for the TTRP (e.g., [24,25]), we have therefore opted a heuristic algorithm based on the SA to solve the TSRP.…”
Section: A Two-stage Heuristic Algorithmmentioning
confidence: 99%
“…[16]. In the TTRP there are not fix costs associated with the vehicles although there are limitations on the number of available trucks and available trailers.…”
Section: Formal Definitionmentioning
confidence: 99%