Engineering Commons^™

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 …

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 …

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. …

Heterogeneous Air Defense Battery Location: A Game Theoretic Approach, Nicholas T. Boardman

Theses and Dissertations

The Unites States and its allies confront a persistent and evolving threat from missile attacks as nations around the world continue to invest and advance their current capabilities. Within the air defense context of a missile-and-interceptor engagement, a challenge for the defender is that surface to air interceptor missile batteries often must be located to protect high-value targets dispersed over a vast area, subject to an attacker observing the disposition of batteries prior to developing and implementing an attack plan. To model this scenario, we formulate a two-player, three-stage, perfect information, sequential move, zero-sum game that accounts for, respectively, a …

An Investigation Of Fast And Frugal Heuristics For New Product Project Selection, Fatima Mohammed Albar

Dissertations and Theses

In the early stages of new product development, project selection is dominantly based on managerial intuition, rather than on analytic approaches. As much as 90% of all product ideas are rejected before they are formally assessed. However, to date, little is known about the product screening heuristics and screening criteria managers use: it has been suggested that their decision process resembles the "fast and frugal" heuristics identified in recent psychological research, but no empirical research exists. A major part of the product innovation pipeline is thus poorly understood.

This research contributes to closing this gap. It uses cognitive task analysis …

The Multiobjective Average Network Flow Problem: Formulations, Algorithms, Heuristics, And Complexity, Jeremy D. Jordan

Theses and Dissertations

Integrating value focused thinking with the shortest path problem results in a unique formulation called the multiobjective average shortest path problem. We prove this is NP-complete for general graphs. For directed acyclic graphs, an efficient algorithm and even faster heuristic are proposed. While the worst case error of the heuristic is proven unbounded, its average performance on random graphs is within 3% of the optimal solution. Additionally, a special case of the more general biobjective average shortest path problem is given, allowing tradeoffs between decreases in arc set cardinality and increases in multiobjective value; the algorithm to solve the average …