As an emerging and sustainable technology, electric vehicles (EVs) are becoming increasingly popular in the transportation system. However, they still have limitations in terms of energy capacity and high consumption....
详细信息
As an emerging and sustainable technology, electric vehicles (EVs) are becoming increasingly popular in the transportation system. However, they still have limitations in terms of energy capacity and high consumption. By implementing flexible scheduling for EV routings, it is hoped that improved efficiency and saved energy consumption can be achieved. This paper focuses on studying a time-dependent electric vehicle routing and scheduling problem with time windows (TDEVRSPTW). The goal is to minimize the total cost of energy consumption, travel distance, and the number of EVs, while considering vehicle travel process scheduling that allows stops at any nodes and along any arcs during periods of time-dependent congestion. For the first time, a mixed integer linear programming model is formulated for the problem, allowing for optimal solutions to small-scale problems using CPLEX. Meanwhile, a variable neighborhood search with partial model (VNS-PM) method is developed to handle the large-scale problem with 200 customers and obtain effective solutions. The numerical experiments demonstrate significant savings in energy consumption by the vehicle travel process scheduling. The proposed method further validates its strong performance by finding 11 new best solutions out of the 56 related EVRPTW benchmark instances. In addition, a case study is conducted to verify the application and energy consumption savings of the proposed problem, which also derives some additional recommendations by sensitivity analysis.
Satellite constellation design problems have been vastly investigated in the existing literature. This work explores decomposition-based methods for the satellite constellation design problem with discontinuous covera...
详细信息
Satellite constellation design problems have been vastly investigated in the existing literature. This work explores decomposition-based methods for the satellite constellation design problem with discontinuous coverage and revisit time. Specifically, two methodologies are provided, based on the decomposition approach and enriched with two novel heuristic rules, to identify a low, possibly minimum, size satellite constellation that allows periodic observation of a set of targets within a specific time window. Numerical experiments are presented to demonstrate the validity of the proposed model.
This paper aims at presenting the multiple depot vehicle scheduling problem with heterogeneous fleet and time windows (MDHFVSP-TW). We used a time-space network (TSN) to perform the modeling of MDHFVSP-TW, along with ...
详细信息
This paper aims at presenting the multiple depot vehicle scheduling problem with heterogeneous fleet and time windows (MDHFVSP-TW). We used a time-space network (TSN) to perform the modeling of MDHFVSP-TW, along with two methodologies to reduce its size and, therefore, its complexity. Along with size reduction methods, a mixedintegerprogramming (MIP) heuristic with variable fixation was presented. Its operation is based on the use of the solution for this problem with relaxed variables as a basis for the removal of arcs from the problem, reducing its size and enabling its resolution in reasonable computational time. Extensive tests were performed for a collection of randomly generated instances. Subsequently, a case study arising from a real instance from a Brazilian city is presented. The computational results showed that the proposed heuristic and size reduction methods obtained good performance, providing high-quality solutions in an adequate computational time.
Optimal scheduling strategy of integrated energy systems (IES) with combined cooling, heating and power (CCHP) has become increasingly important. In order to make the scheduling strategy fit to the practical implement...
详细信息
Optimal scheduling strategy of integrated energy systems (IES) with combined cooling, heating and power (CCHP) has become increasingly important. In order to make the scheduling strategy fit to the practical implementation, this paper proposes a variable performance parameters temperature-flowrate scheduling model for IES with CCHP. The novel scheduling model is established by taking flowrate and temperature as decision variables directly. In addition, performance parameters are treated as variables rather than constants in the proposed model. Specifically, the efficiencies of the gas turbine and the waste heating boiler are estimated with the partial load factor, and the coefficient of performance (COP) of the electrical chillers and heat pumps are estimated with the partial load factor and outlet water temperature. Then, to deal with the model nonlinearities caused by considering the variability of COPs, the COP-expansion method is developed by adopting a specific representation of the COP and the expansion of the outlet water temperature. Finally, case studies show that the variable performance parameters' temperature-flowrate scheduling model can account for the variation of performance parameters, especially the impacts of water temperature and the part load factor on the COP. Therefore, the proposed scheduling model can obtain more adequate and feasible operation strategy, thereby suggesting its applicability in engineering practice.
The classical combinatorial problem of scheduling is extensively studied and arises in several economic domains. However, there are few studies in the automobile sector, particularly in scheduling vehicle repair tasks...
详细信息
ISBN:
(纸本)9783030791650;9783030791643
The classical combinatorial problem of scheduling is extensively studied and arises in several economic domains. However, there are few studies in the automobile sector, particularly in scheduling vehicle repair tasks and using real instances. This paper intends to contribute to fill this gap, focusing on the scheduling of the repairs of the mechanical section of a Portuguese firm in the automobile sector. A mathematical model is presented that will assist the shop manager on the scheduling of the repairs, taking into account: the mechanics and other resources that are available, the mechanical interventions to be performed on each vehicle and its expected processing time. The aim is to reduce the time of inactivity of the vehicles between interventions, as well as, the downtime of mechanics, and therefore improve productivity. The results, from real instances extracted from the data provided by the firm, show that the interventions are scheduled in a suitable form, and there is a reduction of the downtimes.
Highly utilized railway networks require regular infrastructure maintenance. Different track sections often need to be closed for entire days to carry out engineering works, which makes the regular timetables no longe...
详细信息
Highly utilized railway networks require regular infrastructure maintenance. Different track sections often need to be closed for entire days to carry out engineering works, which makes the regular timetables no longer feasible and thus adjusted railway services and temporary alternative services need to be planned. We introduce the Multimodal Alternative Services for Possessions (MASP) problem to support the planning of alternative services, from the passenger and transport operator points of view, including an adjusted train timetable, bus-bridging services and extra train services. The MASP problem is formulated based on the Service Network Design Problem and the Vehicle Routing Problem. To solve it efficiently, we develop a solution framework that incorporates heuristics based on the column and row generation with mixed-integerlinearprogramming. The developed framework provides the optimized alternative service routes, schedules and passenger flows routing. We demonstrated the performance of the MASP solution framework on the real-life Dutch railway network. The results show that the MASP framework is capable of efficiently generating alternative services to route passenger flows affected by possessions with a very limited increase in the total passenger costs compared to a scenario with no link closures. High computational efficiency is observed even for highly disrupted networks.
This paper develops a bi-level control framework that considers the mixed traffic flow of autonomous vehicles (AVs) and human-driven vehicles (HVs) in transport networks. Our framework consists of a multi-class dynami...
详细信息
ISBN:
(数字)9781665468800
ISBN:
(纸本)9781665468800
This paper develops a bi-level control framework that considers the mixed traffic flow of autonomous vehicles (AVs) and human-driven vehicles (HVs) in transport networks. Our framework consists of a multi-class dynamic traffic assignment at the upper level to determine the optimal traffic flow splits for vehicles, while an end-to-end trajectory planning algorithm for AVs is incorporated into the lower level to attain the eco-driving strategy in the mixed traffic environment. The macroscopic decisions (e.g. traffic flow splits) at the upper level can directly affect the progression of the mixed traffic flows, while microscopic decisions (e.g. trajectory profiles) at the lower level can provide realistic feedback (e.g. link supply capacities) to guide the search direction of the upper level and ultimately improve the obtained solution. Besides, we also introduce an effective solution method for this framework that solves the mixed-integerlinearprogramming models at the upper and lower levels. Numerical results indicate that even a low penetration rate of AVs can significantly reduce fuel consumption. Furthermore, AVs can reduce the total travel time of traffic users, eventually mitigating the congestion in the networks.
Utilizing unmanned aerial vehicles for delivery service has been drawing attention in the logistics industry. Since commercial unmanned aerial vehicles have fundamental limitations on payloads and battery capacities, ...
详细信息
Utilizing unmanned aerial vehicles for delivery service has been drawing attention in the logistics industry. Since commercial unmanned aerial vehicles have fundamental limitations on payloads and battery capacities, hybrid ground vehicle and unmanned aerial vehicle models have been actively investigated as practical solutions. However, these studies have focused on linehaul (delivery) demands, excluding a large number of backhaul (pickup) demands. If we consider both demands at the same time, an empty unmanned aerial vehicle that finished linehaul service can be immediately used to serve a backhaul customer. In this study, we investigate the differences that arise by considering backhauls as an additional element of the routing problem. A mixed integer linear programming model is developed, and a heuristic is constructed to solve large-scale problems. To demonstrate the effectiveness of our model, we compare it to existing models using a real-world example. Our solution is also evaluated based on experiments employing a large number of randomly generated datasets.
In this paper, we consider the network slicing problem which attempts to map multiple customized virtual network requests (also called services) to a common shared network infrastructure and allocate network resources...
详细信息
ISBN:
(纸本)9781665405409
In this paper, we consider the network slicing problem which attempts to map multiple customized virtual network requests (also called services) to a common shared network infrastructure and allocate network resources to meet diverse quality of service (QoS) requirements. We first propose a mixedinteger nonlinear program (MINLP) formulation for this problem that optimizes the network resource consumption while jointly considers QoS requirements, flow routing, and resource budget constraints. In particular, the proposed formulation is able to flexibly route the traffic flow of the services on multiple paths and provide end-to-end (E2E) delay and reliability guarantees for all services. Due to the intrinsic nonlinearity, the MINLP formulation is computationally difficult to solve. To overcome this difficulty, we then propose a mixedintegerlinear program (MILP) formulation and show that the two formulations and their continuous relaxations are equivalent. Different from the continuous relaxation of the MINLP formulation which is a nonconvex nonlinearprogramming problem, the continuous relaxation of the MILP formulation is a polynomial time solvable linearprogramming problem, which makes the MILP formulation much more computationally solvable. Numerical results demonstrate the effectiveness and efficiency of the proposed formulations over existing ones.
The article studies a variant of the facility location problem applied for electric vehicle charging station infrastructure in Romania. The best places are chosen from the locations without a charging station to minim...
详细信息
暂无评论