Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 8 of 8
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
The Heterogeneous Vehicle Routing Problem With Multiple Time Windows For The E-Waste Collection Problem, Aldy Gunawan, Minh P.K Nguyen, Vincent F. Yu, Dang Viet Anh Nguyen
The Heterogeneous Vehicle Routing Problem With Multiple Time Windows For The E-Waste Collection Problem, Aldy Gunawan, Minh P.K Nguyen, Vincent F. Yu, Dang Viet Anh Nguyen
Research Collection School Of Computing and Information Systems
Waste from electrical and electronic equipment (WEEE) or e-waste describes end-of-life electronic products that are discarded. Due to their toxic and negative impacts to humans' health, many publications have been proposed to handle, however, studies related to e-waste collection and transportation to waste disposal sites are not widely studied so far. This study proposes a mixed integer linear programming (MILP) model to solve the e-waste collecting problem by formulating it as the heterogeneous vehicle routing problem with multiple time windows (HVRPMTW). The model is validated with newly developed benchmark instances that are solved by commercial software, CPLEX. The model is …
A Review On Learning To Solve Combinatorial Optimisation Problems In Manufacturing, Cong Zhang, Yaoxin Wu, Yining Ma, Wen Song, Zhang Le, Zhiguang Cao, Jie Zhang
A Review On Learning To Solve Combinatorial Optimisation Problems In Manufacturing, Cong Zhang, Yaoxin Wu, Yining Ma, Wen Song, Zhang Le, Zhiguang Cao, Jie Zhang
Research Collection School Of Computing and Information Systems
An efficient manufacturing system is key to maintaining a healthy economy today. With the rapid development of science and technology and the progress of human society, the modern manufacturing system is becoming increasingly complex, posing new challenges to both academia and industry. Ever since the beginning of industrialisation, leaps in manufacturing technology have always accompanied technological breakthroughs from other fields, for example, mechanics, physics, and computational science. Recently, machine learning (ML) technology, one of the crucial subjects of artificial intelligence, has made remarkable progress in many areas. This study thoroughly reviews how ML, specifically deep (reinforcement) learning, motivates new ideas …
Vehicle Routing: Review Of Benchmark Datasets, Aldy Gunawan, Graham Kendall, Barry Mccollum, Hsin-Vonn Seow, Lai Soon Lee
Vehicle Routing: Review Of Benchmark Datasets, Aldy Gunawan, Graham Kendall, Barry Mccollum, Hsin-Vonn Seow, Lai Soon Lee
Research Collection School Of Computing and Information Systems
The Vehicle Routing Problem (VRP) was formally presented to the scientific literature in 1959 by Dantzig and Ramser (DOI:10.1287/mnsc.6.1.80). Sixty years on, the problem is still heavily researched, with hundreds of papers having been published addressing this problem and the many variants that now exist. Many datasets have been proposed to enable researchers to compare their algorithms using the same problem instances where either the best known solution is known or, in some cases, the optimal solution is known. In this survey paper, we provide a list of Vehicle Routing Problem datasets, categorized to enable researchers to have easy access …
Deep Reinforcement Learning Approach To Solve Dynamic Vehicle Routing Problem With Stochastic Customers, Waldy Joe, Hoong Chuin Lau
Deep Reinforcement Learning Approach To Solve Dynamic Vehicle Routing Problem With Stochastic Customers, Waldy Joe, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
In real-world urban logistics operations, changes to the routes and tasks occur in response to dynamic events. To ensure customers’ demands are met, planners need to make these changes quickly (sometimes instantaneously). This paper proposes the formulation of a dynamic vehicle routing problem with time windows and both known and stochastic customers as a route-based Markov Decision Process. We propose a solution approach that combines Deep Reinforcement Learning (specifically neural networks-based TemporalDifference learning with experience replay) to approximate the value function and a routing heuristic based on Simulated Annealing, called DRLSA. Our approach enables optimized re-routing decision to be generated …
Goods Consumed During Transit In Split Delivery Vehicle Routing Problems: Modeling And Solution, Wenzhe Yang, Di Wang, Wei Pang, Ah-Hwee Tan, You Zhou
Goods Consumed During Transit In Split Delivery Vehicle Routing Problems: Modeling And Solution, Wenzhe Yang, Di Wang, Wei Pang, Ah-Hwee Tan, You Zhou
Research Collection School Of Computing and Information Systems
This article presents the modeling and solution of an extended type of split delivery vehicle routing problem (SDVRP). In SDVRP, the demands of customers need to be met by efficiently routing a given number of capacitated vehicles, wherein each customer may be served multiple times by more than one vehicle. Furthermore, in many real-world scenarios, consumption of vehicles en route is the same as the goods being delivered to customers, such as food, water and fuel in rescue or replenishment missions in harsh environments. Moreover, the consumption may also be in virtual forms, such as time spent in constrained tasks. …
A Mathematical Programming Model For The Green Mixed Fleet Vehicle Routing Problem With Realistic Energy Consumption And Partial Recharges, Vincent F. Yu, Panca Jodiwan, Aldy Gunawan, Audrey Tedja Widjaja
A Mathematical Programming Model For The Green Mixed Fleet Vehicle Routing Problem With Realistic Energy Consumption And Partial Recharges, Vincent F. Yu, Panca Jodiwan, Aldy Gunawan, Audrey Tedja Widjaja
Research Collection School Of Computing and Information Systems
A green mixed fleet vehicle routing with realistic energy consumption and partial recharges problem (GMFVRP-REC-PR) is addressed in this paper. This problem involves a fixed number of electric vehicles and internal combustion vehicles to serve a set of customers. The realistic energy consumption which depends on several variables is utilized to calculate the electricity consumption of an electric vehicle and fuel consumption of an internal combustion vehicle. Partial recharging policy is included into the problem to represent the real life scenario. The objective of this problem is to minimize the total travelled distance and the total emission produced by internal …
Finding The 'Faster' Path In Vehicle Routing, Jing Guo, Yaoxin Wu, Xuexi Zhang, Le Zhang, Wei Chen, Zhiguang Cao, Hongliang Guo
Finding The 'Faster' Path In Vehicle Routing, Jing Guo, Yaoxin Wu, Xuexi Zhang, Le Zhang, Wei Chen, Zhiguang Cao, Hongliang Guo
Research Collection School Of Computing and Information Systems
In this study, the authors improve the faster criterion in vehicle routing by extending the bi-delta distribution to the bi-normal distribution, which is a reasonable assumption for travel time on each road link. Based on this assumption, theoretical models are built for an arbitrary path and subsequently adopted to evaluate two candidate paths through probabilistic comparison. Experimental results demonstrate the bi-normal behaviour of link travel time in practice, and verify the faster criterion's superiority in determining the optimal path either on an artificial network with bi-normal distribution modelling link travel time or on a real road network with real traffic …
Real-Life Vehicle Routing With Non-Standard Constraints, Wee Leong Lee
Real-Life Vehicle Routing With Non-Standard Constraints, Wee Leong Lee
Research Collection School Of Computing and Information Systems
Real-life vehicle routing problems comprise of a number of complexities that are not considered by the classical models found in vehicle routing literature. I present, in this paper, a two-stage sweep-based heuristic to find good solutions to a real-life Vehicle Routing Problem (VRP). The problem I shall consider, will deal with some non-standard constraints beyond those normally associated with the classical VRP. Other than considering the capacity constraints for vehicles and the time windows for deliveries, I shall introduce four additional non-standard constraints: merging of customer orders, controlling the maximum number of drop points, matching orders to vehicle types, and …