A bi-objective multimodal transportation planning problem with an application to a petrochemical ethylene manufacturer

2016 ◽  
Vol 20 (1) ◽  
pp. 72-88 ◽  
Author(s):  
Sinem Tokcaer ◽  
Özgür Özpeynirci
2021 ◽  
Vol 233 ◽  
pp. 108004
Author(s):  
Maria João Santos ◽  
Eduardo Curcio ◽  
Pedro Amorim ◽  
Margarida Carvalho ◽  
Alexandra Marques

Mathematics ◽  
2020 ◽  
Vol 8 (10) ◽  
pp. 1788
Author(s):  
Yanjun Shi ◽  
Na Lin ◽  
Qiaomei Han ◽  
Tongliang Zhang ◽  
Weiming Shen

This paper addresses a collaborative multi-carrier vehicle routing problem (CMCVRP) where carriers tackle their orders collaboratively to reduce transportation costs. First, a hierarchical heuristics algorithm is proposed to solve the transportation planning problem. This algorithm makes order assignments based on two distance rules and solves the vehicle routing problem with a hybrid genetic algorithm. Second, the profit arising from the coalition is quantified, and an improved Shapley value method is proposed to distribute the profit fairly to individual players. Extensive experiment results showed the effectiveness of the proposed hierarchical heuristics algorithm and confirmed the stability and fairness of the improved Shapley value method.


2001 ◽  
Vol 15 (4) ◽  
pp. 275-283 ◽  
Author(s):  
Karen K. Dixon ◽  
Wayne A. Sarasua ◽  
Janice Daniel ◽  
George D. Mazur

Sign in / Sign up

Export Citation Format

Share Document