Open Access. Powered by Scholars. Published by Universities.®
Artificial Intelligence and Robotics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Publication
- Publication Type
Articles 1 - 3 of 3
Full-Text Articles in Artificial Intelligence and Robotics
Multi-Objective Model Of Distribution Route Problem For Fresh Electricity Commerce Under Uncertain Demand, Zhang Qian, Xiong Ying, Mingke He, Zhang Hao
Multi-Objective Model Of Distribution Route Problem For Fresh Electricity Commerce Under Uncertain Demand, Zhang Qian, Xiong Ying, Mingke He, Zhang Hao
Journal of System Simulation
Abstract: Considering the distribution cost, freshness of fresh products, carbon emissions and customer demand uncertainty and other factors, a multi-objective optimization model of distribution path planning is established. Based on the robust optimization method for dealing with uncertain problems, the multi-objective model of distribution routing planning is optimized for the situation that the discrete demand belongs to the uncertainty set of ellipsoid. The model is solved by using the main target method and fruit fly algorithm. It is proved that the model and algorithm are robust and can effectively suppress the disturbance caused by the uncertainty of the demand. This …
Harmony Search Algorithm For Time-Dependent Vehicle Routing Problem With Time Windows, Yun-Chia Liang, Vanny Minanda, Aldy Gunawan, Angela Hsiang-Ling Chen
Harmony Search Algorithm For Time-Dependent Vehicle Routing Problem With Time Windows, Yun-Chia Liang, Vanny Minanda, Aldy Gunawan, Angela Hsiang-Ling Chen
Research Collection School Of Computing and Information Systems
Vehicle Routing Problem (VRP) is a combinatorial problem where a certain set of nodes must be visited within a certain amount of time as well as the vehicle’s capacity. There are numerous variants of VRP such as VRP with time windows, where each node has opening and closing time, therefore, the visiting time must be during that interval. Another variant takes time-dependent constraint into account. This variant fits real-world scenarios, where at different period of time, the speed on the road varies depending on the traffic congestion. In this study, three objectives – total traveling time, total traveling distance, and …
Integrated Assignment And Routing With Mixed Service Mode Cross-Dock, Vincent Yu, Aldy Gunawan, Eric I. Junaidi, Audrey T. Widjaja
Integrated Assignment And Routing With Mixed Service Mode Cross-Dock, Vincent Yu, Aldy Gunawan, Eric I. Junaidi, Audrey T. Widjaja
Research Collection School Of Computing and Information Systems
Amixed service mode cross-dock is a cross-dock facility that considers the useof flexible doors. Instead of having a specific task as an exclusive mode, eachdoor can be used as a flexible door, either an inbound or an outbound doordepending on the requirement. Having a mixed service mode cross-dock in anintegrated assignment and routing problem is a new model in large field ofcross-docking problems. Decisions that need to be made include doors’functionality, suppliers’ assignments, customers’ deliveries, and vehicles’ routeswith the objective of minimizing the total transportation and material handlingcosts. We develop a mathematical programming model and propose a SimulatedAnnealing (SA) algorithm …