2013
DOI: 10.1080/10556788.2013.768993
|View full text |Cite
|
Sign up to set email alerts
|

Solving a vehicle routing problem with resource conflicts and makespan objective with an application in car body manufacturing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 6 publications
0
3
0
Order By: Relevance
“…According to Braekers et al [4], they are not considered standard objective functions although both are based on time or distance. These functions have been used in parcel applications [47], load balancing in home health services [48], manufacturing processing times [49]. Other practical problems where (f2) gains importance is in bus routing, where the maximum travel time of the first student collected in the route wants to be minimized [50,51].…”
Section: Plos Onementioning
confidence: 99%
“…According to Braekers et al [4], they are not considered standard objective functions although both are based on time or distance. These functions have been used in parcel applications [47], load balancing in home health services [48], manufacturing processing times [49]. Other practical problems where (f2) gains importance is in bus routing, where the maximum travel time of the first student collected in the route wants to be minimized [50,51].…”
Section: Plos Onementioning
confidence: 99%
“…The complexity of this problem has been discussed extensively [1]. There are studies that solve similar problems with exact methods such as [2] [3] [4]. However, the exact methods are only effective for small instances without considering different robotic factors (inverse kinematics 'IK' solutions , number of robots, accessibility constraints, obstacle avoidance, robot-robot collision, among others).…”
Section: Introductionmentioning
confidence: 99%
“…Aircraft routing is an example of a combinatorial optimization problem, a problem type found in many real-world domains where resource allocation is critical, including air traffic control (Stergianos et al 2015), shipping and transportation (Crainic et al 2009;Zäpfel and Wasner 2002), and manufacturing (Rambau and Schwarz 2014;Venkateshan et al 2008). As implied by the name "combinatorial," such problems can consist of solving combinations of choices, and the complexity is often in the interaction of the elements.…”
Section: Introductionmentioning
confidence: 99%