The freight consolidation and containerization problem

•Introduced a new freight transportation problem.•Proposed a linear programming formulation for the problem.•Designed a customized memetic algorithm to solve problem instances of practical size.•Generated benchmark instances for the problem based on typical values encountered in practice.•Demonstrat...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 234; číslo 1; s. 37 - 48
Hlavní autoři: Qin, Hu, Zhang, Zizhen, Qi, Zhuxuan, Lim, Andrew
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 01.04.2014
Elsevier Sequoia S.A
Témata:
China
Consolidation
Containerization
Containers
Costs
Freight consolidation
Freight forwarding
Integer programming
Mathematical models
Memetic algorithm
Packing
Parcels
Ports
Route optimization
Shipments
Studies
Third party
Third-party logistics
Transportation problem (Operations research)
Warehouses
United States > US
China
Shanghai China
Memetic algorithm
Third-party logistics
Packing
Containerization
Freight consolidation
ISSN:0377-2217, 1872-6860
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•Introduced a new freight transportation problem.•Proposed a linear programming formulation for the problem.•Designed a customized memetic algorithm to solve problem instances of practical size.•Generated benchmark instances for the problem based on typical values encountered in practice.•Demonstrated our approach is superior to CPLEX for large instances. In today’s global free market, third-party logistics providers (3PLs) are becoming increasingly important. This paper studies a problem faced by a 3PL operating a warehouse in Shanghai, China, under contract with a major manufacturer of children’s clothing based in the United States. At the warehouse, the 3PL receives textile parcel shipments from the suppliers located in China; each shipment is destined for different retail stores located across the United Sates. These shipments must be consolidated and loaded into containers of varying sizes and costs, and then sent along shipping routes to different destination ports. An express company, such as UPS and FedEx, unloads the shipments from the containers at the destination ports and distributes them to their corresponding stores or retailers by parcel delivery. The objective is to find an allocation that minimizes the total container transportation and parcel delivery costs. We formulate the problem into an integer programming model, and also propose a memetic algorithm approach to solve the problem practically. A demonstration of a good solution to this problem was a decisive factor in the awarding of the contract to the 3PL in question.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2013.09.015