This page has only limited features, please log in for full access.
This paper presents a set covering model based on route representation to solve the green ship routing and scheduling problem (GSRSP) with berth time-window constraints for multiple bulk ports. A bi-objective set covering model is constructed with features based on the minimization of the total CO2 equivalent emissions and the total travel time subject to a limited number of berths in each port, berthing time windows, and the time window for each job. The solutions are obtained using the ε-constraint method, after which a Pareto frontier is plotted. This problem is motivated by the operations of feeder barges and terminals, where the logistics control tower is used to coordinate the routing and berthing time of its barges. We show that the proposed method outperforms the weighted sum method in terms of the number of Pareto solutions and the value of the hypervolume indicator.
Apichit Maneengam; Apinanthana Udomsakdigool. A Set Covering Model for a Green Ship Routing and Scheduling Problem with Berth Time-Window Constraints for Use in the Bulk Cargo Industry. Applied Sciences 2021, 11, 4840 .
AMA StyleApichit Maneengam, Apinanthana Udomsakdigool. A Set Covering Model for a Green Ship Routing and Scheduling Problem with Berth Time-Window Constraints for Use in the Bulk Cargo Industry. Applied Sciences. 2021; 11 (11):4840.
Chicago/Turabian StyleApichit Maneengam; Apinanthana Udomsakdigool. 2021. "A Set Covering Model for a Green Ship Routing and Scheduling Problem with Berth Time-Window Constraints for Use in the Bulk Cargo Industry." Applied Sciences 11, no. 11: 4840.
In this paper, we propose a bi-objective programming model to select the optimal route for moving a consignment of goods between the anchorage area at the Gulf of Thailand to factories throughout Thailand using a multimodal transportation network and joint consideration of transportation mode selection. The bi-objective programming model is constructed with features based on two objective functions - minimizing transportation costs and minimizing CO 2 emissions, subject to transportation jobs that should be completed before their respective due dates. The solutions are obtained by the ε-constraint method, after which a Pareto frontier will be plotted. The decision makers can make a decision tradeoff between the two objectives from that plot.
Apichit Maneengam. A Bi-Objective Programming Model for Multimodal Transportation Routing Problem of Bulk Cargo Transportation. 2020 IEEE 7th International Conference on Industrial Engineering and Applications (ICIEA) 2020, 890 -894.
AMA StyleApichit Maneengam. A Bi-Objective Programming Model for Multimodal Transportation Routing Problem of Bulk Cargo Transportation. 2020 IEEE 7th International Conference on Industrial Engineering and Applications (ICIEA). 2020; ():890-894.
Chicago/Turabian StyleApichit Maneengam. 2020. "A Bi-Objective Programming Model for Multimodal Transportation Routing Problem of Bulk Cargo Transportation." 2020 IEEE 7th International Conference on Industrial Engineering and Applications (ICIEA) , no. : 890-894.
Apichit Maneengam; Apinanthana Udomsakdigool. Solving the collaborative bidirectional multi-period vehicle routing problems under a profit-sharing agreement using a covering model. International Journal of Industrial Engineering Computations 2020, 185 -200.
AMA StyleApichit Maneengam, Apinanthana Udomsakdigool. Solving the collaborative bidirectional multi-period vehicle routing problems under a profit-sharing agreement using a covering model. International Journal of Industrial Engineering Computations. 2020; ():185-200.
Chicago/Turabian StyleApichit Maneengam; Apinanthana Udomsakdigool. 2020. "Solving the collaborative bidirectional multi-period vehicle routing problems under a profit-sharing agreement using a covering model." International Journal of Industrial Engineering Computations , no. : 185-200.
In this paper, a covering model based on a route representation was developed for bi-directional, full truckload vehicle routing problems with time windows and split delivery of bulk transportation. The aim is to select the best routes from feasible solutions with minimum total cost. Computational experiments carried out in real-life instances indicated that the proposed algorithm was able to perform effectively.
Apichit Maneengam; Apinanthana Udomsakdigool. Solving the Bidirectional Multi-Period Full Truckload Vehicle Routing Problem with Time Windows and Split Delivery for Bulk Transportation Using a Covering Model. 2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM) 2018, 798 -802.
AMA StyleApichit Maneengam, Apinanthana Udomsakdigool. Solving the Bidirectional Multi-Period Full Truckload Vehicle Routing Problem with Time Windows and Split Delivery for Bulk Transportation Using a Covering Model. 2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). 2018; ():798-802.
Chicago/Turabian StyleApichit Maneengam; Apinanthana Udomsakdigool. 2018. "Solving the Bidirectional Multi-Period Full Truckload Vehicle Routing Problem with Time Windows and Split Delivery for Bulk Transportation Using a Covering Model." 2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM) , no. : 798-802.
Apichit Maneengam; Penyarat Saisirirat; Patpimol Suwankan. Hook Design Loading by The Optimization Method With Weighted Factors Rating Method. Energy Procedia 2017, 138, 337 -342.
AMA StyleApichit Maneengam, Penyarat Saisirirat, Patpimol Suwankan. Hook Design Loading by The Optimization Method With Weighted Factors Rating Method. Energy Procedia. 2017; 138 ():337-342.
Chicago/Turabian StyleApichit Maneengam; Penyarat Saisirirat; Patpimol Suwankan. 2017. "Hook Design Loading by The Optimization Method With Weighted Factors Rating Method." Energy Procedia 138, no. : 337-342.