Vehicle routing in containers pickup up and delivery processes

Vidović, Milorad; Radivojević, Gordana; Raković, Branislava

doi:10.1016/j.sbspro.2011.08.039

Cited by 36 publications

(25 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The separation of trucks and containers has been investigated by Jula et al (2005), Chung et al (2007), Zhang et al (2011), Zhang et al (2010, Vidovic et al (2011), Braekers et al (2013 and Nossack and Pesch (2013). The variant where trucks and containers are coupled received less attention; in fact it has been investigated only in papers motivated by specific technical restrictions (ie, Imai et al, 2007) or regulation policies (Cheung et al, 2008).…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

An adaptive guidance meta-heuristic for the vehicle routing problem with splits and clustered backhauls

Laí

Battarra

Francesco

et al. 2015

Journal of the Operational Research Society

View full text Add to dashboard Cite

This paper presents the case study of an Italian carrier, Grendi Trasporti Marittimi, which provides freight transportation services by trucks and containers. Its trucks deliver container loads from a port to import customers and collect container loads from export customers to the same port. In this case study, all import customers in a route must be serviced before all export customers, each customer can be visited more than once and containers are never unloaded or reloaded from the truck chassis along any route. We model the problem using an Integer Linear Programming formulation and propose an Adaptive Guidance metaheuristic. Our extensive computational experiments show that the adaptive guidance algorithm is capable of determining good-quality solutions in many instances of practical or potential interest for the carrier within 10 min of computing time, whereas the mathematical formulation often fails to provide the first feasible solution within 3 h of computing time

show abstract

Section: Literature Reviewmentioning

confidence: 99%

“…To conclude, the transportation of more-than-one container per truck was rarely investigated (Chung et al, 2007;Vidovic et al, 2011;Lai et al, 2013). In addition, LCVs represent an interesting and not-yet-investigated opportunity to reduce costs in drayage problems.…”

Section: Literature Reviewmentioning

confidence: 99%

An adaptive guidance meta-heuristic for the vehicle routing problem with splits and clustered backhauls

Laí

Battarra

Francesco

et al. 2015

Journal of the Operational Research Society

View full text Add to dashboard Cite

show abstract

“…Even under a dense inland depot setting, a 23% operations cost reduction is achievable in average across all testing examples. Testing on numerical examples drawn from realistic geographical data shows that up to 350 orders can be solved using the MILP model within reasonable time (about 30 min), which outperforms traditional models that are based on the VRP-SPDTW which normally solves instances up to 75 (Vidović et al, 2011). Without needing any heuristics, more accurate and reliable solution can be achieved efficiently by the proposed model.…”

Section: Discussionmentioning

confidence: 95%

“…Some trucks are able to transport two 20-ft containers at a time, allowing the combination of two import or two export movements at a time. Before 2012, only two papers had looked into this: Chung et al (2007) who worked on a one-to-one pickup and delivery problem, and Vidović et al (2011) who determined routes from the matching of pickup and delivery nodes with empty and loaded containers. Like the majority of the 40-ft container focused papers, the majority of 20-ft container combinations focus upon the strip method of unloading containers.…”

Section: Literature Reviewmentioning

confidence: 99%

An efficient mixed integer programming model for pairing containers in inland transportation based on the assignment of orders

Daham

Yang

Warnes

2017

Journal of the Operational Research Society

View full text Add to dashboard Cite

The inland transportation takes a significant portion of the total cost that arises from intermodal transportation. In addition, there are many parties (shipping lines, haulage companies, customers) who share this operation as well as many restrictions that increase the complexity of this problem and make it NP-hard. Therefore, it is important to create an efficient strategy to manage this process in a way to ensure all parties are satisfied. This paper investigates the pairing of containers/orders in drayage transportation from the perspective of delivering paired containers on 40-ft truck and/or individual containers on 20-ft truck, between a single port and a list of customer locations. An assignment mixed integer linear programming model is formulated, which solves the problem of how to combine orders in delivery to save the total transportation cost when orders with both single and multiple destinations exist. In opposition to the traditional models relying on the vehicle routing problem with simultaneous pickups and deliveries and time windows formulation, this model falls into the assignment problem category which is more efficient to solve on large size instances. Another merit for the proposed model is that it can be implemented on different variants of the container drayage problem: import only, import-inland and import-inland-export. Results show that in all cases the pairing of containers yields less cost compared to the individual delivery and decreases empty tours. The proposed model can be solved to optimality efficiently (within half hour) for over 300 orders.

show abstract

“…First, in most of the related studies containers are supposed to be left at customer locations, and drivers can move to other customers, thereby bypassing packing and unpacking operations (Wang et al 2002;Jula et al 2005;Chung et al 2007;Zhang et al 2010Zhang et al , 2011Vidovic et al 2011;Braekers et al 2013;Nossack and Pesch 2013). Conversely, in this case study trucks move loaded containers to import customers and drivers wait for the empty containers, while unpacking operations are performed.…”

Section: Introductionmentioning

confidence: 99%

A set-covering formulation for a drayage problem with single and double container loads

et al. 2018

View full text Add to dashboard Cite

This paper addresses a drayage problem, which is motivated by the case study of a real carrier. Its trucks carry one or two containers from a port to importers and from exporters to the port. Since up to four customers can be served in each route, we propose a set-covering formulation for this problem where all possible routes are enumerated. This model can be efficiently solved to optimality by a commercial solver, significantly outperforming a previously proposed node-arc formulation. Moreover, the model can be effectively used to evaluate a new distribution policy, which results in an enlarged set of feasible routes and can increase savings w.r.t. the policy currently employed by the carrier.

show abstract

Vehicle routing in containers pickup up and delivery processes

Cited by 36 publications

References 12 publications

An adaptive guidance meta-heuristic for the vehicle routing problem with splits and clustered backhauls

An adaptive guidance meta-heuristic for the vehicle routing problem with splits and clustered backhauls

An efficient mixed integer programming model for pairing containers in inland transportation based on the assignment of orders

A set-covering formulation for a drayage problem with single and double container loads

Contact Info

Product

Resources

About