Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Optimization (2)
- Routing (2)
- Transportation (2)
- Adaptive large neighborhood search (1)
- Agent-based modeling (1)
-
- Agent-based simulation (1)
- Autonomous agents (1)
- Behavioral research (1)
- Bus scheduling (1)
- Coalition formation (1)
- Combinatorial Optimization (1)
- Computational models (1)
- Cooperative delivery (1)
- Cooperative game theory (1)
- Core (1)
- Deep reinforcement learning; divide and conquer-based framework; interactive training; multi-UAV task scheduling (1)
- Demand (1)
- Docking (1)
- Drones; trip assignment; priority rules; flying capacity; load balance (1)
- Economies (1)
- Empirical validation (1)
- Energy consumption (1)
- Flexible compartment (1)
- Framework (1)
- Game theory (1)
- Gaussian distribution (1)
- Generalized actor critic (1)
- Graph-based algorithm. (1)
- Heuristic algorithms (1)
- Home-refill (1)
Articles 1 - 12 of 12
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
An Adaptive Large Neighborhood Search For The Multi-Vehicle Profitable Tour Problem With Flexible Compartments And Mandatory Customers, Vincent F. Yu, Nabila Yuraisyah Salsabila, Aldy Gunawan, Anggun Nurfitriani Handoko
An Adaptive Large Neighborhood Search For The Multi-Vehicle Profitable Tour Problem With Flexible Compartments And Mandatory Customers, Vincent F. Yu, Nabila Yuraisyah Salsabila, Aldy Gunawan, Anggun Nurfitriani Handoko
Research Collection School Of Computing and Information Systems
The home-refill delivery system is a business model that addresses the concerns of plastic waste and its impact on the environment. It allows customers to pick up their household goods at their doorsteps and refill them into their own containers. However, the difficulty in accessing customers’ locations and product consolidations are undeniable challenges. To overcome these issues, we introduce a new variant of the Profitable Tour Problem, named the multi-vehicle profitable tour problem with flexible compartments and mandatory customers (MVPTPFC-MC). The objective is to maximize the difference between the total collected profit and the traveling cost. We model the proposed …
Editorial: Emerging On-Demand Passenger And Logistics Systems: Modelling, Optimization, And Data Analytics, Jintao Ke, Hai Wang, Neda Masoud, Maximilian Schiffer, Goncalo H. A. Correia
Editorial: Emerging On-Demand Passenger And Logistics Systems: Modelling, Optimization, And Data Analytics, Jintao Ke, Hai Wang, Neda Masoud, Maximilian Schiffer, Goncalo H. A. Correia
Research Collection School Of Computing and Information Systems
The proliferation of smart personal devices and mobile internet access has fueled numerous advancements in on-demand transportation services. These services are facilitated by online digital platforms and range from providing rides to delivering products. Their influence is transforming transportation systems and leaving a mark on changing individual mobility, activity patterns, and consumption behaviors. For instance, on-demand transportation companies such as Uber, Lyft, Grab, and DiDi have become increasingly vital for meeting urban transportation needs by connecting available drivers with passengers in real time. The recent surge in door-to-door food delivery (e.g., Uber Eats, DoorDash, Meituan); grocery delivery (e.g., Amazon Fresh, …
T-Pickseer: Visual Analysis Of Taxi Pick-Up Point Selection Behavior, Shuxian Gu, Yemo Dai, Zezheng Feng, Yong Wang, Haipeng Zeng
T-Pickseer: Visual Analysis Of Taxi Pick-Up Point Selection Behavior, Shuxian Gu, Yemo Dai, Zezheng Feng, Yong Wang, Haipeng Zeng
Research Collection School Of Computing and Information Systems
Taxi drivers often take much time to navigate the streets to look for passengers, which leads to high vacancy rates and wasted resources. Empty taxi cruising remains a big concern for taxi companies. Analyzing the pick-up point selection behavior can solve this problem effectively, providing suggestions for taxi management and dispatch. Many studies have been devoted to analyzing and recommending hotspot regions of pick-up points, which can make it easier for drivers to pick-up passengers. However, the selection of pick-up points is complex and affected by multiple factors, such as convenience and traffic management. Most existing approaches cannot produce satisfactory …
Characterizing Linearizable Qaps By The Level-1 Reformulation-Linearization Technique, Lucas Waddell, Warren Adams
Characterizing Linearizable Qaps By The Level-1 Reformulation-Linearization Technique, Lucas Waddell, Warren Adams
Faculty Journal Articles
The quadratic assignment problem (QAP) is an extremely challenging NP-hard combinatorial optimization program. Due to its difficulty, a research emphasis has been to identify special cases that are polynomially solvable. Included within this emphasis are instances which are linearizable; that is, which can be rewritten as a linear assignment problem having the property that the objective function value is preserved at all feasible solutions. Various known sufficient conditions for identifying linearizable instances have been explained in terms of the continuous relaxation of a weakened version of the level-1 reformulation-linearization-technique (RLT) form that does not enforce nonnegativity on a subset …
Glop: Learning Global Partition And Local Construction For Solving Large-Scale Routing Problems In Real-Time, Haoran Ye, Jiarui Wang, Helan Liang, Zhiguang Cao, Yong Li, Fanzhang Li
Glop: Learning Global Partition And Local Construction For Solving Large-Scale Routing Problems In Real-Time, Haoran Ye, Jiarui Wang, Helan Liang, Zhiguang Cao, Yong Li, Fanzhang Li
Research Collection School Of Computing and Information Systems
The recent end-to-end neural solvers have shown promise for small-scale routing problems but suffered from limited real-time scaling-up performance. This paper proposes GLOP (Global and Local Optimization Policies), a unified hierarchical framework that efficiently scales toward large-scale routing problems. GLOP partitions large routing problems into Travelling Salesman Problems (TSPs) and TSPs into Shortest Hamiltonian Path Problems. For the first time, we hybridize non-autoregressive neural heuristics for coarse-grained problem partitions and autoregressive neural heuristics for fine-grained route constructions, leveraging the scalability of the former and the meticulousness of the latter. Experimental results show that GLOP achieves competitive and state-of-the-art real-time performance …
Cooperative Trucks And Drones For Rural Last-Mile Delivery With Steep Roads, Jiuhong Xiao, Ying Li, Zhiguang Cao, Jianhua Xiao
Cooperative Trucks And Drones For Rural Last-Mile Delivery With Steep Roads, Jiuhong Xiao, Ying Li, Zhiguang Cao, Jianhua Xiao
Research Collection School Of Computing and Information Systems
The cooperative delivery of trucks and drones promises considerable advantages in delivery efficiency and environmental friendliness over pure fossil fuel fleets. As the prosperity of rural B2C e-commerce grows, this study intends to explore the prospect of this cooperation mode for rural last-mile delivery by developing a green vehicle routing problem with drones that considers the presence of steep roads (GVRPD-SR). Realistic energy consumption calculations for trucks and drones that both consider the impacts of general factors and steep roads are incorporated into the GVRPD-SR model, and the objective is to minimize the total energy consumption. To solve the proposed …
Dl-Drl: A Double-Level Deep Reinforcement Learning Approach For Large-Scale Task Scheduling Of Multi-Uav, Xiao Mao, Guohua Wu, Mingfeng Fan, Zhiguang Cao, Witold Pedrycz
Dl-Drl: A Double-Level Deep Reinforcement Learning Approach For Large-Scale Task Scheduling Of Multi-Uav, Xiao Mao, Guohua Wu, Mingfeng Fan, Zhiguang Cao, Witold Pedrycz
Research Collection School Of Computing and Information Systems
Exploiting unmanned aerial vehicles (UAVs) to execute tasks is gaining growing popularity recently. To address the underlying task scheduling problem, conventional exact and heuristic algorithms encounter challenges such as rapidly increasing computation time and heavy reliance on domain knowledge, particularly when dealing with large-scale problems. The deep reinforcement learning (DRL) based methods that learn useful patterns from massive data demonstrate notable advantages. However, their decision space will become prohibitively huge as the problem scales up, thus deteriorating the computation efficiency. To alleviate this issue, we propose a double-level deep reinforcement learning (DL-DRL) approach based on a divide and conquer framework …
Methods That Support The Validation Of Agent-Based Models: An Overview And Discussion, Andrew Collins, Matthew Koehler, Christopher Lynch
Methods That Support The Validation Of Agent-Based Models: An Overview And Discussion, Andrew Collins, Matthew Koehler, Christopher Lynch
Engineering Management & Systems Engineering Faculty Publications
Validation is the process of determining if a model adequately represents the system under study for the model’s intended purpose. Validation is a critical component in building the credibility of a simulation model with its end-users. Effectively conducting validation can be a daunting task for both novice and experienced simulation developers. Further compounding the difficult task of conducting validation is that there is no universally accepted approach for assessing a simulation. These challenges are particularly relevant to the paradigm of Agent-Based Modeling and Simulation (ABMS) because of the complexity found in these models’ mechanisms and in the real-world situations they …
Abmscore: A Heuristic Algorithm For Forming Strategic Coalitions In Agent-Based Simulation, Andrew J. Collins, Gayane Grigoryan
Abmscore: A Heuristic Algorithm For Forming Strategic Coalitions In Agent-Based Simulation, Andrew J. Collins, Gayane Grigoryan
Engineering Management & Systems Engineering Faculty Publications
Integrating human behavior into agent-based models has been challenging due to its diversity. An example is strategic coalition formation, which occurs when an individual decides to collaborate with others because it strategically benefits them, thereby increasing the expected utility of the situation. An algorithm called ABMSCORE was developed to help model strategic coalition formation in agent-based models. The ABMSCORE algorithm employs hedonic games from cooperative game theory and has been applied to various situations, including refugee egress and smallholder farming cooperatives. This paper discusses ABMSCORE, including its mechanism, requirements, limitations, and application. To demonstrate the potential of ABMSCORE, a new …
An Algorithm Based On Priority Rules For Solving A Multi-Drone Routing Problem In Hazardous Waste Collection, Youssef Harrath Dr., Jihene Kaabi Dr.
An Algorithm Based On Priority Rules For Solving A Multi-Drone Routing Problem In Hazardous Waste Collection, Youssef Harrath Dr., Jihene Kaabi Dr.
Research & Publications
This research investigates the problem of assigning pre-scheduled trips to multiple drones to collect hazardous waste from different sites in the minimum time. Each drone is subject to essential restrictions: maximum flying capacity and recharge operation. The goal is to assign the trips to the drones so that the waste is collected in the minimum time. This is done if the total flying time is equally distributed among the drones. An algorithm was developed to solve the problem. The algorithm is based on two main ideas: sort the trips according to a given priority rule and assign the current trip …
Optimal Algorithm For Managing On-Campus Student Transportation, Youssef Harrath Dr.
Optimal Algorithm For Managing On-Campus Student Transportation, Youssef Harrath Dr.
Research & Publications
This study analyzed the transportation issues at the University of Bahrain Sakhir campus, where a bus system with an unorganized and fixed number of buses allocated each semester was in place. Data was collected through a survey, on-site observations, and student schedules to estimate the number of buses needed. The study was limited to students who require to move between buildings for academic purposes and not those who choose to ride buses for other reasons. An algorithm was designed to calculate the optimal number of buses for each time slot, and for each day. This solution could improve transportation efficiency, …
Segac: Sample Efficient Generalized Actor Critic For The Stochastic On-Time Arrival Problem, Honglian Guo, Zhi He, Wenda Sheng, Zhiguang Cao, Yingjie Zhou, Weinan Gao
Segac: Sample Efficient Generalized Actor Critic For The Stochastic On-Time Arrival Problem, Honglian Guo, Zhi He, Wenda Sheng, Zhiguang Cao, Yingjie Zhou, Weinan Gao
Research Collection School Of Computing and Information Systems
This paper studies the problem in transportation networks and introduces a novel reinforcement learning-based algorithm, namely. Different from almost all canonical sota solutions, which are usually computationally expensive and lack generalizability to unforeseen destination nodes, segac offers the following appealing characteristics. segac updates the ego vehicle’s navigation policy in a sample efficient manner, reduces the variance of both value network and policy network during training, and is automatically adaptive to new destinations. Furthermore, the pre-trained segac policy network enables its real-time decision-making ability within seconds, outperforming state-of-the-art sota algorithms in simulations across various transportation networks. We also successfully deploy segac …