Open Access. Powered by Scholars. Published by Universities.®
Artificial Intelligence and Robotics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Engineering (17)
- Operations Research, Systems Engineering and Industrial Engineering (15)
- Computer Engineering (11)
- Numerical Analysis and Scientific Computing (10)
- Systems Science (10)
-
- Theory and Algorithms (4)
- Public Affairs, Public Policy and Public Administration (3)
- Social and Behavioral Sciences (3)
- Transportation (3)
- Computer and Systems Architecture (1)
- Controls and Control Theory (1)
- Electrical and Computer Engineering (1)
- Software Engineering (1)
- Systems and Communications (1)
- Urban Studies and Planning (1)
- Institution
- Publication Year
- Publication
- Publication Type
Articles 1 - 23 of 23
Full-Text Articles in Artificial Intelligence and Robotics
Research Advances On Electric Vehicle Routing Problem Models And Algorithms, Helin Zhuang, Xiaoyun Xia, Kangshun Li, Zefeng Chen, Xianchao Zhang
Research Advances On Electric Vehicle Routing Problem Models And Algorithms, Helin Zhuang, Xiaoyun Xia, Kangshun Li, Zefeng Chen, Xianchao Zhang
Journal of System Simulation
Abstract: The development of electric vehicle provides an alternative to conventional fuel vehicles for logistics companies. Using electric vehicles has the merits of less pollution and low noise, but the characteristics of limited cruising range and limited number of charging stations are new challenges. Electric vehicle routing problems(EVRPs) have been widely used in transportation, logistics and other fields, and have received much attention. A comprehensive survey of EVRP and its many variants are presented and the respective backgrounds and applicable conditions are analyzed. The solving approaches of EVRPs are categorized, the strengths and weaknesses of each algorithm are analyzed, and …
Emergency Material Scheduling Based On Discrete Shuffled Frog Leaping Algorithm, Xiaoning Shen, Zhongpei Ge, Chengbin Yao, Liyan Song, Yufang Wang
Emergency Material Scheduling Based On Discrete Shuffled Frog Leaping Algorithm, Xiaoning Shen, Zhongpei Ge, Chengbin Yao, Liyan Song, Yufang Wang
Journal of System Simulation
Abstract: A mathematical model of emergency material scheduling after earthquakes is built. The model evaluates the emergency degree of each disaster area based on the disaster situation and designs a method to split the demand of the disaster area, improving the efficiency of vehicle utilization. To solve the model, this paper proposes a discrete shuffled frog leaping algorithm with multi-resource learning. The multiple information sources introduced by the proposed algorithm can expand the search direction and reduce the assimilation speed of the population in the algorithm. Second, the worst individual in each subgroup can learn the effective information in the …
Multi-Depot Half-Open Vehicle Routing Problem With Simultaneous Delivery-Pickup And Time Windows, Yingyu Zhang, Liyun Wu, Shengtai Jia
Multi-Depot Half-Open Vehicle Routing Problem With Simultaneous Delivery-Pickup And Time Windows, Yingyu Zhang, Liyun Wu, Shengtai Jia
Journal of System Simulation
Abstract: To solve the multi-depot half-open vehicle routing problem with simultaneous delivery-pickup and time windows, this paper builds a mathematical model of a multi-depot half-open vehicle routing problem with simultaneous delivery-pickup and time windows by balancing the vehicle in and out of the distribution center and minimizing vehicle delivery distance as the goal. According to the characteristics of the problem, a brain storm algorithm based on chaotic mutation is designed to solve this problem,and the sequential crossover strategy is adopted to increase the population diversity. Meanwhile, the algorithm selects two chaotic maps for chaotic mutation operation, which employs the diversity, …
Reinforcement Learning Approach To Stochastic Vehicle Routing Problem With Correlated Demands, Zangir Iklassov, Ikboljon Sobirov, Ruben Solozabal, Martin Takac
Reinforcement Learning Approach To Stochastic Vehicle Routing Problem With Correlated Demands, Zangir Iklassov, Ikboljon Sobirov, Ruben Solozabal, Martin Takac
Machine Learning Faculty Publications
We present a novel end-to-end framework for solving the Vehicle Routing Problem with stochastic demands (VRPSD) using Reinforcement Learning (RL). Our formulation incorporates the correlation between stochastic demands through other observable stochastic variables, thereby offering an experimental demonstration of the theoretical premise that non-i.i.d. stochastic demands provide opportunities for improved routing solutions. Our approach bridges the gap in the application of RL to VRPSD and consists of a parameterized stochastic policy optimized using a policy gradient algorithm to generate a sequence of actions that form the solution. Our model outperforms previous state-of-the-art metaheuristics and demonstrates robustness to changes in the …
The Vehicle Routing Problem With Simultaneous Pickup And Delivery And Occasional Drivers, Vincent F. Yu, Grace Aloina, Panca Jodiawan, Aldy Gunawan, Tsung-C. Huang
The Vehicle Routing Problem With Simultaneous Pickup And Delivery And Occasional Drivers, Vincent F. Yu, Grace Aloina, Panca Jodiawan, Aldy Gunawan, Tsung-C. Huang
Research Collection School Of Computing and Information Systems
This research addresses the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Occasional Drivers (VRPSPDOD), which is inspired from the importance of addressing product returns and the emerging notion of involving available crowds to perform pickup and delivery activities in exchange for some compensation. At the depot, a set of regular vehicles is available to deliver and/or pick up customers’ goods. A set of occasional drivers, each defined by their origin, destination, and flexibility, is also able to help serve the customers. The objective of VRPSPDOD is to minimize the total traveling cost of operating regular vehicles and total …
Two-Phase Matheuristic For The Vehicle Routing Problem With Reverse Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
Two-Phase Matheuristic For The Vehicle Routing Problem With Reverse Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
Research Collection School Of Computing and Information Systems
Cross-dockingis a useful concept used by many companies to control the product flow. It enables the transshipment process of products from suppliers to customers. This research thus extends the benefit of cross-docking with reverse logistics, since return process management has become an important field in various businesses. The vehicle routing problem in a distribution network is considered to be an integrated model, namely the vehicle routing problem with reverse cross-docking (VRP-RCD). This study develops a mathematical model to minimize the costs of moving products in a four-level supply chain network that involves suppliers, cross-dock, customers, and outlets. A matheuristic based …
Research On Time-Dependent Vehicle Routing Problem With Multiple Time Windows, Nan Li, Rong Hu, Bin Qian, Huaiping Jin, Naikang Yu
Research On Time-Dependent Vehicle Routing Problem With Multiple Time Windows, Nan Li, Rong Hu, Bin Qian, Huaiping Jin, Naikang Yu
Journal of System Simulation
Abstract: Aiming at the time-dependent vehicle routing problem with multiple time windows (TD_VRPMTW) that considers urban traffic congestion, a hybrid discrete gray wolf optimizer (HDGWO) is proposed. In the HDGWO, a new grey wolf individual updating formula is designed, and the integer coding method based on customer permutation is adopted, so that the algorithm can directly perform the global search based on GWO individual updating mechanism in the discrete problem solution space.A population initialization strategy based on the nature of the problem is designed to generate the initial population with high quality and diversity.The information exchange formula of …
Simulation On Cold Chain Distribution Path Of Fresh Agricultural Products Under Low-Carbon Constraints, Tao Ning, Tao Gou, Xiangdong Liu
Simulation On Cold Chain Distribution Path Of Fresh Agricultural Products Under Low-Carbon Constraints, Tao Ning, Tao Gou, Xiangdong Liu
Journal of System Simulation
Abstract: The freshness distribution requirements of fresh agricultural products may increase the carbon emissions of the cold chain distribution process. A cold chain distribution scheduling strategy and simulation method for the fresh agricultural products under low-carbon constraints is proposed. Based on the quantitative analysis of the carbon tax mechanism, a mathematical model of minimizing the carbon emissions and minimizing the overall cost of distribution is established. Comprehensively analyzing the conventional factors such as the product delivery volume, delivery time and loading and unloading time in logistics distribution, an improved quantum ant colony algorithm based on adaptive rotation angle …
Study On Near-Body Pressure Characteristics Of Bionic Robotic Fish Undulating In Near Wall Region, Ou Xie, Aiguo Song, Qixin Zhu
Study On Near-Body Pressure Characteristics Of Bionic Robotic Fish Undulating In Near Wall Region, Ou Xie, Aiguo Song, Qixin Zhu
Journal of System Simulation
Abstract: To avoid unbalanced workload assignment, we studied the vehicle routing problem with refined oil secondary distribution considering workload balance. A bi-objectivemixed integer programming model was built to minimize the total distribution cost and the maximum difference in vehicle route length. A heuristic variable neighborhood tabu search algorithm was designed. An improved Solomon_I1 insertion algorithm was developed to generate afeasible initial solution such that the total distribution cost was as small as possible. Then, the variable neighborhood tabu search algorithm was used to improve the initial solution and thereby obtain the approximate optimal solution. The simulation results show that in …
Metaheuristics For Time-Dependent Vehicle Routing Problem With Time Windows, Yun-C Liang, Vanny Minanda, Aldy Gunawan, Hsiang-L. Chen
Metaheuristics For Time-Dependent Vehicle Routing Problem With Time Windows, Yun-C Liang, Vanny Minanda, Aldy Gunawan, Hsiang-L. Chen
Research Collection School Of Computing and Information Systems
Vehicle routing problem (VRP), a combinatorial problem, deals with the vehicle’s capacity visiting a particular set of nodes while its variants attempt to fit real-world scenarios. Our study aims to minimise total travelling time, total distance, and the number of vehicles under time-dependent and time windows constraints (TDVRPTW). The harmony search algorithm (HSA) focuses on the harmony memory and pitch adjustment mechanism for new solution construction. Several local search operators and a roulette wheel for the performance improvement were verified via 56 Solomon’s VRP instances by adding a speed matrix. The performance comparison with a genetic algorithm (GA) was completed …
Learning Ant Colony Algorithm For Green Multi-Depot Vehicle Routing Problem, Hu Rong, Wenbo Chen, Bin Qian, Guo Ning, Fenghong Xiang
Learning Ant Colony Algorithm For Green Multi-Depot Vehicle Routing Problem, Hu Rong, Wenbo Chen, Bin Qian, Guo Ning, Fenghong Xiang
Journal of System Simulation
Abstract: Considering the congested roads situation of urban central areas in China, a speed calculation method based on vehicle driving sections is designed, and a model for the Green Multi-Depot Vehicle Routing Problem with Total Fuel-Consumption cost Criterion (TFC-GMDVRP) is established, considering simultaneously the vehicle travel distance, load, and speed factors. A learning ant colony optimization algorithm (LACO), combining a knowledge model and an ant colony optimization algorithm (ACO), is proposed for solving the TFC-GMDVRP. In order to improve the performance and robustness of the algorithm's global search, the parameter knowledge that contains the different …
A Matheuristic Algorithm For The Vehicle Routing Problem With Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
A Matheuristic Algorithm For The Vehicle Routing Problem With Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
Research Collection School Of Computing and Information Systems
This paper studies the integration of the vehicle routing problem with cross-docking (VRPCD). The aim is to find a set of routes to deliver products from a set of suppliers to a set of customers through a cross-dock facility, such that the operational and transportation costs are minimized, without violating the vehicle capacity and time horizon constraints. A two-phase matheuristic based on column generation is proposed. The first phase focuses on generating a set of feasible candidate routes in both pickup and delivery processes by implementing an adaptive large neighborhood search algorithm. A set of destroy and repair operators are …
Vehicle Routing Optimization Model Of Cold Chain Logistics Based On Stochastic Demand, Xiangguo Ma, Tongjuan Liu, Pingzhe Yang, Rongfen Jiang
Vehicle Routing Optimization Model Of Cold Chain Logistics Based On Stochastic Demand, Xiangguo Ma, Tongjuan Liu, Pingzhe Yang, Rongfen Jiang
Journal of System Simulation
Abstract: The costs of vehicle distribution in the process of cold chain logistics is analyzed and amended; A mathematical model with mixing time window is built to balance the customers' service request with importance level; To minimize the total cost, a mathematical model which uses a factor to make balance between the stability of customer demand fluctuation and the cost increase in the assignment phase is established. Based on MATLAB software, the optical solution is found with adaptive genetic algorithm by taking the background of a distribution center to simulate and analyze.
Adaptive Large Neighborhood Search For Vehicle Routing Problem With Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
Adaptive Large Neighborhood Search For Vehicle Routing Problem With Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
Research Collection School Of Computing and Information Systems
Cross-docking is considered as a method to manage and control the inventory flow, which is essential in the context of supply chain management. This paper studies the integration of the vehicle routing problem with cross-docking, namely VRPCD which has been extensively studied due to its ability to reducethe overall costs occurring in a supply chain network. Given a fleet of homogeneous vehicles for delivering a single type of product from suppliers to customers through a cross-dock facility, the objective of VRPCD is to determine the number of vehicles used and the corresponding vehicle routes, such that the vehicleoperational and transportation …
Flight Support Service Time Estimation Of Hub Airport, Zhiwei Xing, Yunxiao Tang
Flight Support Service Time Estimation Of Hub Airport, Zhiwei Xing, Yunxiao Tang
Journal of System Simulation
Abstract: For the convenience of airport to publish the accurate information about flight status to passengers in time, estimating the service time of airport flight support is needed. Because the flight support service is a mixed procedure of job shop and fixed site, and has characteristics of time window constrains and resource demand difference, a model of flight support service procedure based on vehicle routing problem with time windows (VRPTW) was built. For the strong NP nature of vehicle routing problems, a two phase hybrid heuristic algorithm based on greedy algorithm and tabu search was proposed. It was applied to …
A Matheuristic Algorithm For Solving The Vehicle Routing Problem With Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
A Matheuristic Algorithm For Solving The Vehicle Routing Problem With Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
Research Collection School Of Computing and Information Systems
This paper studies the integration of the vehicle routing problem with cross-docking, namely VRPCD. The aim is to find a set of routes to deliver single products from a set of suppliers to a set of customers through a cross-dock facility, such that the operational and transportation costs are minimized, without violating the vehicle capacity and time horizon constraints. A two-phase matheuristic approach that uses the routes of the local optima of an adaptive large neighborhood search (ALNS) as columns in a set-partitioning formulation of the VRPCD is designed. This matheuristic outperforms the state-of-the-art algorithms in solving a subset of …
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 …
Designing Bus Transit Services For Routine Crowd Situations At Large Event Venues, Jianli Du, Shih-Fen Cheng, Hoong Chuin Lau
Designing Bus Transit Services For Routine Crowd Situations At Large Event Venues, Jianli Du, Shih-Fen Cheng, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
We are concerned with the routine crowd management problem after a major event at a known venue. Without properly design complementary transport services, such sudden crowd build-ups will overwhelm the existing infrastructure. In this paper, we introduce a novel flow-rate based model to model the dynamic movement of passengers over the transportation flow network. Based on this basic model, an integer linear programming model is proposed to solve the bus transit problem permanently. We validate our model against a real scenario in Singapore, where a newly constructed mega-stadium hosts various large events regularly. The results show that the proposed approach …
Pickup And Delivery Problem With Time Windows: Algorithms And Test Case Generation, Hoong Chuin Lau, Zhe Liang
Pickup And Delivery Problem With Time Windows: Algorithms And Test Case Generation, Hoong Chuin Lau, Zhe Liang
Research Collection School Of Computing and Information Systems
In the pickup and delivery problem with time windows (PDPTW), vehicles have to transport loads from origins to destinations respecting capacity and time constraints. In this paper, we present a two-phase method to solve the PDPTW. In the first phase, we apply a novel construction heuristics to generate an initial solution. In the second phase, a tabu search method is proposed to improve the solution. Another contribution of this paper is a strategy to generate good problem instances and benchmarking solutions for PDPTW, based on Solomon' s benchmark test cases for VRPTW. Experimental results show that our approach yields very …
Pickup And Delivery Problem With Time Windows: Algorithms And Test Case Generation, Hoong Chuin Lau, Zhe Liang
Pickup And Delivery Problem With Time Windows: Algorithms And Test Case Generation, Hoong Chuin Lau, Zhe Liang
Research Collection School Of Computing and Information Systems
In the pickup and delivery problem with time windows (PDPTW), vehicles have to transport loads from origins to destinations respecting capacity and time constraints. In this paper, we present a two-phase method to solve the PDPTW. In the first phase, we apply a novel construction heuristics to generate an initial solution. In the second phase, a tabu search method is proposed to improve the solution. Another contribution of this paper is a strategy to generate good problem instances and benchmarking solutions for PDPTW, based on Solomon's benchmark test cases for VRPTW. Experimental results show that our approach yields very good …
Simulation Study Of Learning Automata Games In Automated Highway Systems, Cem Unsal, Pushkin Kachroo, John S. Bay
Simulation Study Of Learning Automata Games In Automated Highway Systems, Cem Unsal, Pushkin Kachroo, John S. Bay
Electrical & Computer Engineering Faculty Research
One of the most important issues in Automated Highway System (AHS) deployment is intelligent vehicle control. While the technology to safely maneuver vehicles exists, the problem of making intelligent decisions to improve a single vehicle’s travel time and safety while optimizing the overall traffic flow is still a stumbling block. We propose an artificial intelligence technique called stochastic learning automata to design an intelligent vehicle path controller. Using the information obtained by on-board sensors and local communication modules, two automata are capable of learning the best possible (lateral and longitudinal) actions to avoid collisions. This learning method is capable of …