2020
DOI: 10.1016/j.cie.2020.106745
|View full text |Cite
|
Sign up to set email alerts
|

A branch-and-price method for the vehicle allocation problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 21 publications
0
3
0
Order By: Relevance
“…The ability to utilize the vehicles as either partially loaded trucks (less-than-truckload, LTL) or fully loaded trucks (full-truckload, FTL) is another reason for the decision makers to prefer road freight transportation in logistics operations. In LTL transportation, a single delivery does not occupy the full capacity of a truck; therefore, a truck can carry the loads collected from multiple locations at the same time, such as in-vehicle routing problems, which increases vehicle utilization (Cruz et al, 2020). This aggregation allows to consolidate smaller loads and utilize larger energy-efficient trucks, potentially resulting in faster and cheaper transportation.…”
Section: The Vehicle Allocation Problemmentioning
confidence: 99%
“…The ability to utilize the vehicles as either partially loaded trucks (less-than-truckload, LTL) or fully loaded trucks (full-truckload, FTL) is another reason for the decision makers to prefer road freight transportation in logistics operations. In LTL transportation, a single delivery does not occupy the full capacity of a truck; therefore, a truck can carry the loads collected from multiple locations at the same time, such as in-vehicle routing problems, which increases vehicle utilization (Cruz et al, 2020). This aggregation allows to consolidate smaller loads and utilize larger energy-efficient trucks, potentially resulting in faster and cheaper transportation.…”
Section: The Vehicle Allocation Problemmentioning
confidence: 99%
“…Ref. [35] utilizes Dantzig-Wolfe decomposition as well as a branch-and-price procedure to solve an MILP model for the vehicle allocation problem.…”
Section: Dantzig-wolfe Decompositionmentioning
confidence: 99%
“…To optimally solve the routing and scheduling problem, we develop a branchand-price (BAP) algorithm, which is the leading exact algorithm for the routing and scheduling problems [29,30,31,32]. The BAP algorithm is composed by embedding the column generation procedure into the branch-and-bound framework.…”
Section: The Framework Of Bap Algorithmmentioning
confidence: 99%