Subjects -> TRANSPORTATION (Total: 214 journals)
    - AIR TRANSPORT (9 journals)
    - AUTOMOBILES (26 journals)
    - RAILROADS (10 journals)
    - ROADS AND TRAFFIC (9 journals)
    - SHIPS AND SHIPPING (43 journals)
    - TRANSPORTATION (117 journals)

TRANSPORTATION (117 journals)                     

Showing 1 - 53 of 53 Journals sorted alphabetically
Accident Analysis & Prevention     Hybrid Journal   (Followers: 128)
Analytic Methods in Accident Research     Hybrid Journal   (Followers: 8)
Applied Mobilities     Hybrid Journal   (Followers: 5)
Asian Transport Studies     Open Access   (Followers: 1)
Botswana Journal of Technology     Full-text available via subscription   (Followers: 1)
Case Studies on Transport Policy     Hybrid Journal   (Followers: 13)
Cities in the 21st Century     Open Access   (Followers: 17)
Communications in Transportation Research     Open Access  
Danish Journal of Transportation Research / Dansk Tidsskrift for Transportforskning     Open Access   (Followers: 1)
Decision Making : Applications in Management and Engineering     Open Access   (Followers: 1)
Economics of Transportation     Partially Free   (Followers: 16)
Emission Control Science and Technology     Hybrid Journal   (Followers: 1)
eTransportation     Open Access   (Followers: 1)
EURO Journal of Transportation and Logistics     Open Access   (Followers: 12)
European Journal of Transport and Infrastructure Research (EJTIR)     Open Access   (Followers: 1)
European Transport Research Review     Open Access   (Followers: 22)
Geosystem Engineering     Hybrid Journal  
IATSS Research     Open Access  
IEEE Open Journal of Intelligent Transportation Systems     Open Access   (Followers: 4)
IEEE Vehicular Technology Magazine     Full-text available via subscription   (Followers: 7)
IET Electrical Systems in Transportation     Open Access   (Followers: 13)
IET Intelligent Transport Systems     Open Access   (Followers: 11)
IET Smart Cities     Open Access  
IFAC-PapersOnLine     Open Access  
International Journal of Applied Logistics     Full-text available via subscription   (Followers: 5)
International Journal of Crashworthiness     Hybrid Journal   (Followers: 10)
International Journal of Electric and Hybrid Vehicles     Hybrid Journal   (Followers: 8)
International Journal of Heavy Vehicle Systems     Hybrid Journal   (Followers: 6)
International Journal of Intelligent Transportation Systems Research     Hybrid Journal   (Followers: 13)
International Journal of Mobile Communications     Hybrid Journal   (Followers: 8)
International Journal of Ocean Systems Management     Hybrid Journal   (Followers: 1)
International Journal of Physical Distribution & Logistics Management     Hybrid Journal   (Followers: 11)
International Journal of Services Technology and Management     Hybrid Journal   (Followers: 1)
International Journal of Sustainable Transportation     Hybrid Journal   (Followers: 18)
International Journal of Traffic and Transportation Engineering     Open Access   (Followers: 12)
International Journal of Transportation Engineering     Open Access   (Followers: 2)
International Journal of Transportation Science and Technology     Open Access   (Followers: 9)
International Journal of Vehicle Systems Modelling and Testing     Hybrid Journal   (Followers: 2)
Journal of Advanced Transportation     Hybrid Journal   (Followers: 12)
Journal of Big Data Analytics in Transportation     Hybrid Journal   (Followers: 2)
Journal of Intelligent and Connected Vehicles     Open Access   (Followers: 1)
Journal of Mechatronics, Electrical Power, and Vehicular Technology     Open Access   (Followers: 6)
Journal of Modern Transportation     Full-text available via subscription   (Followers: 7)
Journal of Navigation     Hybrid Journal   (Followers: 176)
Journal of Sport & Social Issues     Hybrid Journal   (Followers: 10)
Journal of Supply Chain Management Science (JSCMS)     Open Access   (Followers: 3)
Journal of Traffic and Transportation Engineering (English Edition)     Open Access   (Followers: 4)
Journal of Transport & Health     Hybrid Journal   (Followers: 12)
Journal of Transport and Land Use     Open Access   (Followers: 26)
Journal of Transport and Supply Chain Management     Open Access   (Followers: 10)
Journal of Transport Geography     Hybrid Journal   (Followers: 22)
Journal of Transport History     Hybrid Journal   (Followers: 12)
Journal of Transportation and Logistics     Open Access   (Followers: 3)
Journal of Transportation Safety & Security     Hybrid Journal   (Followers: 9)
Journal of Transportation Security     Hybrid Journal   (Followers: 3)
Journal of Transportation Technologies     Open Access   (Followers: 13)
Journal of Waterway Port Coastal and Ocean Engineering     Full-text available via subscription   (Followers: 7)
Journal on Vehicle Routing Algorithms     Hybrid Journal  
Les Dossiers du Grihl     Open Access   (Followers: 1)
LOGI ? Scientific Journal on Transport and Logistics     Open Access  
Logistics     Open Access   (Followers: 1)
Logistics & Sustainable Transport     Open Access   (Followers: 4)
Logistique & Management     Hybrid Journal  
Maritime Transport Research     Open Access  
Mobility in History     Full-text available via subscription   (Followers: 7)
Modern Transportation     Open Access   (Followers: 11)
Nonlinear Dynamics     Hybrid Journal   (Followers: 19)
Open Journal of Safety Science and Technology     Open Access   (Followers: 16)
Open Transportation Journal     Open Access   (Followers: 1)
Packaging, Transport, Storage & Security of Radioactive Material     Hybrid Journal   (Followers: 2)
Periodica Polytechnica Transportation Engineering     Open Access  
Pervasive and Mobile Computing     Hybrid Journal   (Followers: 8)
Proceedings of the Institution of Mechanical Engineers Part F: Journal of Rail and Rapid Transit     Hybrid Journal   (Followers: 11)
Promet : Traffic &Transportation     Open Access  
Public Transport     Hybrid Journal   (Followers: 18)
Recherche Transports Sécurité     Hybrid Journal   (Followers: 1)
Research in Transportation Business and Management     Partially Free   (Followers: 4)
Revista Transporte y Territorio     Open Access  
Romanian Journal of Transport Infrastructure     Open Access   (Followers: 1)
Sport, Education and Society     Hybrid Journal   (Followers: 12)
Sport, Ethics and Philosophy     Hybrid Journal   (Followers: 2)
Streetnotes     Open Access   (Followers: 2)
Synthesis Lectures on Mobile and Pervasive Computing     Full-text available via subscription   (Followers: 1)
Transactions on Transport Sciences     Open Access   (Followers: 4)
Transport     Open Access   (Followers: 16)
Transport and Telecommunication     Open Access   (Followers: 4)
Transport in Porous Media     Hybrid Journal  
Transport Problems     Open Access   (Followers: 4)
Transport Reviews: A Transnational Transdisciplinary Journal     Hybrid Journal   (Followers: 11)
Transportation     Hybrid Journal   (Followers: 32)
Transportation Engineering     Open Access   (Followers: 1)
Transportation Geotechnics     Full-text available via subscription   (Followers: 1)
Transportation in Developing Economies     Hybrid Journal  
Transportation Infrastructure Geotechnology     Hybrid Journal   (Followers: 8)
Transportation Journal     Full-text available via subscription   (Followers: 16)
Transportation Letters : The International Journal of Transportation Research     Hybrid Journal   (Followers: 4)
Transportation Research Interdisciplinary Perspectives     Open Access   (Followers: 2)
Transportation Research Part A: Policy and Practice     Hybrid Journal   (Followers: 38)
Transportation Research Part B: Methodological     Hybrid Journal   (Followers: 38)
Transportation Research Part C: Emerging Technologies     Hybrid Journal   (Followers: 29)
Transportation Research Procedia     Open Access   (Followers: 6)
Transportation Research Record : Journal of the Transportation Research Board     Full-text available via subscription   (Followers: 29)
Transportation Safety and Environment     Open Access   (Followers: 1)
Transportation Science     Full-text available via subscription   (Followers: 25)
Transportation Systems and Technology     Open Access  
TRANSPORTES     Open Access   (Followers: 3)
Transportmetrica A : Transport Science     Hybrid Journal   (Followers: 7)
Transportmetrica B : Transport Dynamics     Hybrid Journal   (Followers: 1)
Travel Behaviour and Society     Full-text available via subscription   (Followers: 9)
Travel Medicine and Infectious Disease     Hybrid Journal   (Followers: 2)
Urban, Planning and Transport Research     Open Access   (Followers: 33)
Vehicles     Open Access  
Vehicular Communications     Full-text available via subscription   (Followers: 4)
World Electric Vehicle Journal     Open Access   (Followers: 3)
World Review of Intermodal Transportation Research     Hybrid Journal   (Followers: 5)
Транспортні системи та технології перевезень     Open Access  

           

Similar Journals
Journal Cover
Journal on Vehicle Routing Algorithms
Number of Followers: 0  
 
  Hybrid Journal Hybrid journal (It can contain Open Access articles)
ISSN (Print) 2367-3591 - ISSN (Online) 2367-3605
Published by Springer-Verlag Homepage  [2469 journals]
  • Allocating limited deicing resources in winter snow events

    • Free pre-print version: Loading...

      Abstract: Abstract As the number and severity of snowfall events continue to grow, the need to direct road maintenance intelligently during these snowfall events will also grow. In several locations, local governments lack the resources to treat all roadways completely during snow events. Furthermore, some governments utilize only traffic data to determine which roads should be treated. As a result, many schools, businesses, and government offices must be unnecessarily closed, which directly impacts the social, educational, and economic well-being of citizens and institutions. In this work, we propose a mixed integer programming (MIP) formulation to allocate resources to manage snowfall on roads using meteorological, geographical, and environmental parameters. Given that MIPs often scale poorly with problem size, we also present a constructive heuristic designed for the problem. Additionally, we evaluate the impacts of an increase in budget for winter road maintenance on snow control resources.
      PubDate: 2019-12-01
      DOI: 10.1007/s41604-019-00015-4
       
  • On a multi-trip vehicle routing problem with time windows integrating
           European and French driver regulations

    • Free pre-print version: Loading...

      Abstract: Abstract In the European Union, truck drivers must comply with Regulation (EC) No 561/2006, which provides a set of rules on the daily or weekly working time and on break or rest periods after specific working times. Truck drivers can be back to the depot much earlier than the end of their working period, and be able to perform other trips. The resulting problem is a Multi-Trip Vehicle Routing Problem with Time Windows, where truck drivers have the possibility to accomplish, during their time horizon, more than one trip, combined with a Truck Driver Scheduling Problem. It aimed to find and assign a set of routes to a fleet of vehicles allowing each customer to be visited within its given time window, and the accumulated load to be delivered (or collected) not exceeding the capacity of the vehicle. Each truck driver must comply with applicable hours of service regulations, and the objective is to minimize total transportation cost. To solve this problem, we have developed a hybrid method composed of a genetic algorithm and a local neighborhood search. Experiments have been conducted on instances from the literature and real-life cases from SYSTRANS, a specialized French software company.
      PubDate: 2019-12-01
      DOI: 10.1007/s41604-019-00016-3
       
  • A dial-a-ride problem using private vehicles and alternative nodes

    • Free pre-print version: Loading...

      Abstract: Abstract This paper addresses the dial-a-ride problem (DARP) using private vehicles and alternative nodes (DARP-PV-AN). The DARP consists of creating vehicle routes in order to ensure a set of users’ transportation requests. Each request corresponds to a client needing to be transported from his/her origin to his/her destination. Routing costs have to be minimized while respecting a set of constraints like time windows and maximum route length. In the classical DARP, vehicles have to start from a depot and come back to it at the end of their route. In the DARP-PV-AN, the on-demand transportation service can be done either by a public fleet or by clients that use their private vehicles. The use of these vehicles adds more flexibility and unclog the public transportation fleet by allowing clients to organize their own transportation. However, it also raises some privacy concerns. The DARP-PV-AN addresses these concerns and focuses on location privacy, i.e., the ability to prevent the third parties from learning clients’ locations, by keeping both original and final locations private. This is addressed by setting several pickup/delivery nodes for the transportation requests, thus masking the private address. A compact mixed integer linear model is presented, and an evolutionary local search (ELS) is proposed to compute solutions of good quality for the problem. These methods are benchmarked on a modified set of benchmark instances. A new set of realistic instances is also provided to test the ELS in a more realistic way.
      PubDate: 2019-12-01
      DOI: 10.1007/s41604-019-00014-5
       
  • Solving a real-life roll-on–roll-off waste collection problem with
           column generation

    • Free pre-print version: Loading...

      Abstract: Abstract In this paper, we develop an intelligent solution to a complex, real-life vehicle routing problem in the waste management sector. Waste management companies deliver various types of empty waste containers to industrial customers, to be filled with different types of waste, after which the containers are picked up again. The full containers are transported to a so-called waste management depot or waste handling depot, where they are emptied, after which they are reused. Empty containers are stocked in various stock depots. Time windows in which containers may be picked up and delivered at the customers and opening hours of the different depots have to be taken into account additionally. Very importantly, there are two types of waste collection trucks that can, respectively, carry one or two containers. The resulting vehicle routing problem belongs to a class of so-called roll-on–roll-off problems, characterized by unit demand. Additionally, the problem discussed in this paper has several characteristics (multiple waste types, multiple container types, multiple depots, a heterogeneous fleet, pickup and delivery, time window constraints, and other) that make solving it a difficult task. To solve this problem, we develop a novel column generation scheme that incorporates a heuristic approach to generate new columns. The master problem is solved by linear relaxation of a set partitioning problem. New routes (columns) are generated by a constructive heuristic loosely based on Solomon’s insertion heuristic for the vehicle routing problem with time windows. The construction heuristic operates on a reformulated version of the roll-on–roll-off problem, i.e., a generalized vehicle routing problem with time windows. The algorithm—called wmpopt—is submitted to an extensive sensitivity analysis to determine its response to different parameter settings. After this, we test it on four real-life problem instances and compare its results to those obtained by a commercial solver. We show that wmpopt achieves much better solutions than the commercial solver in similar computing times.
      PubDate: 2019-05-10
      DOI: 10.1007/s41604-019-00013-6
       
  • Emergent intelligence technique-based transport depot resource management
           in a metropolitan area

    • Free pre-print version: Loading...

      Abstract: Abstract A metropolitan area experiences transport resource scarcities and dynamic resource allocation problems due to huge number of commuters’ population, dynamic commuters’ arrival rates, etc. The progress of these problems results into economic loss, traffic congestion, inefficient utilization of resources and increase in indefinite waiting time of commuters. Hence, we propose a dynamic transport resource allocation scheme. The scheme efficiently manages number of vehicles over time and space using emergent intelligence (EI) technique. Based on the historical information, commuters’ arrival rates, resource availability, deficit resources, surplus resources of neighbor depots, etc., the EI technique with agents is used for collecting, analyzing, sharing and allocating resources, for optimal utilization of resources in a metropolitan area. Analytical model of EI technique-based transport resource allocation scheme is developed using Markov chain, and derived the closed-form expression of optimal utilization of resources. Performance evaluation is carried out with varying number of commuters’ arrival rates, vehicles, requests and number of neighborhood depots. We observe that results obtained in the simulation and analysis reflect the effectiveness of the proposed scheme in a metropolitan area.
      PubDate: 2019-03-18
      DOI: 10.1007/s41604-019-00012-7
       
  • The VeRoLog Solver Challenge 2019

    • Free pre-print version: Loading...

      Abstract: Abstract The VeRoLog Solver Challenge 2019 is the \({4{\mathrm{th}}}\) solver challenge facilitated by VeRoLog, the EURO Working Group on Vehicle Routing and Logistics. The challenge is organized in cooperation with ORTEC. On behalf of the organizing committee, the authors report on the problem and organization of the challenge.
      PubDate: 2019-03-13
      DOI: 10.1007/s41604-019-00011-8
       
  • On automatic algorithm configuration of vehicle routing problem solvers

    • Free pre-print version: Loading...

      Abstract: Abstract Many of the algorithms for solving vehicle routing problems expose parameters that strongly influence the quality of obtained solutions and the performance of the algorithm. Finding good values for these parameters is a tedious task that requires experimentation and experience. Therefore, methods that automate the process of algorithm configuration have received growing attention. In this paper, we present a comprehensive study to critically evaluate and compare the capabilities and suitability of seven state-of-the-art methods in configuring vehicle routing metaheuristics. The configuration target is the solution quality of eight metaheuristics solving two vehicle routing problem variants. We show that the automatic algorithm configuration methods find good parameters for the vehicle route optimization metaheuristics and clearly improve the solutions obtained over default parameters. Our comparison shows that despite some observable differences in configured performance there is no single configuration method that always outperforms the others. However, largest gains in performance can be made by carefully selecting the right configurator. The findings of this paper may give insights on how to effectively choose and extend automatic parameter configuration methods and how to use them to improve vehicle routing solver performance.
      PubDate: 2019-02-22
      DOI: 10.1007/s41604-019-00010-9
       
  • A look-ahead partial routing framework for the stochastic and dynamic
           vehicle routing problem

    • Free pre-print version: Loading...

      Abstract: Abstract In this paper, we study the vehicle routing problem with dynamic customers, where a portion of the customer requests are known in advance and the rest arrive in real time. We propose an optimization-based look-ahead dynamic routing framework that involves request forecasting, partial planning, and dynamic real-time routing of the fleet. This framework has the capabilities for adjustments in response to routing environments with different levels of uncertainties. Through extensive numeral simulations, we exam its performance in routing environments with various levels of uncertainties. We demonstrate the efficiency and robustness of the proposed solution by benchmarking against two other routing strategies. This paper fills the gap in the literature on studying the relationship between the level of route planning in the solution approach and the quality of the solution under various system conditions.
      PubDate: 2018-11-01
      DOI: 10.1007/s41604-018-0006-5
       
  • Performance analysis of a metaheuristic algorithm for the line-haul feeder
           vehicle routing problem

    • Free pre-print version: Loading...

      Abstract: Abstract The line-haul feeder vehicle routing problem (LFVRP) is a rather new and therefore hardly investigated problem and can be seen as vehicle routing problem with synchronisation constraints. Synchronisation takes place if two or more vehicles (small and large vehicles) meet at the same place and at the same time and perform a transshipment of goods. Small vehicles are used to serve customers which are difficult to access (e.g. due to traffic jams, narrow streets or limited parking space). The downside is their limited capacity. To avoid the journey back to the depot, the small vehicle can meet with a large vehicle at a customer with enough space for reloading. Thus, the small vehicle uses the large vehicle as virtual depot and is able to save time and reduce costs. In Brandstätter and Reimann (Eur J Oper Res 270:157–170, 2018), we already introduced two promising solution approaches to master the LFVRP—the Linkage- and Split-Approach. Both approaches were shown to find high-quality solutions in short time. Moreover, we demonstrated the advantage of the LFVRP strategy when compared with the heterogeneous fleet vehicle routing problem. With this paper, we propose and justify several improvements to our original algorithms. These include the application of Ant Colony Optimization, different local search operators, as well as the exact solution of a sub-problem. To highlight the performance contribution of these modifications, we perform a thorough and extensive computational experiment. We evaluate each algorithmic component individually as well as their combination and statistically validate the benefits. Overall, we find that the final algorithm improves our previous approaches by almost 9% at a computational cost of a few seconds.
      PubDate: 2018-11-01
      DOI: 10.1007/s41604-018-0009-2
       
  • Intelligent motion planning of a mobile robot with dynamic obstacle
           avoidance

    • Free pre-print version: Loading...

      Abstract: Abstract Intelligent navigation in cluttered environment while insuring maximum safety and task efficiency is a challenging subject. Motion planning is an important issue in the field of autonomous mobile robots which makes them capable to travel from one position to another in various environments including both static and dynamic obstacles without any human intervention. This research is conducted for the purpose of designing and programming a mobile robot using two separated fuzzy logic controllers to develop an intelligent algorithm in order to avoid both static and dynamic obstacles. These fuzzy logic controllers play a significant role in mobile robot navigation and obstacle avoidance behavior. In this work, four essential behavior controllers are designed and implemented onto the robot to assist its navigation towards the goal which are: goal reaching behavior, speed control behavior, goal searching behavior and obstacle avoidance behavior. The obstacle avoidance behavior is divided into two individual behaviors which are static obstacle avoidance behavior and dynamic obstacle avoidance behavior where these behaviors are controlled by an artificial intelligence (AI) algorithm. In order to design obstacle avoidance behavior, Sugeno fuzzy logic was applied. The simulation of this research was done by MATLAB software where a mobile robot and some experimental environments with different complexity were created. Several navigation tests were conducted and the robot’s behavior were observed as well. Analysis of the robot’s performance validated the effectiveness of the proposed controllers and the robot could successfully navigate to reach the goal through all experimental environments.
      PubDate: 2018-11-01
      DOI: 10.1007/s41604-018-0007-4
       
  • Heuristics for the weighted k -rural postman problem with applications to
           urban snow removal

    • Free pre-print version: Loading...

      Abstract: Abstract We describe a weighted version of the k-Chinese and k-rural postman problem that occurs in the context of snow removal. The problem concerns the questions of which vehicle shall take care of each link and how the vehicles shall travel between links. We also consider different numbers of vehicles, in view of a fixed cost for each vehicle. We describe and discuss heuristic solution approaches, based on usable substructures, such as heuristics for rural postman problems, meta-heuristics, k-means clustering and local search improvements by moving cycles. The methods have been implemented and tested on real life examples.
      PubDate: 2018-11-01
      DOI: 10.1007/s41604-018-0008-3
       
  • The VeRoLog solver challenge 2016–2017

    • Free pre-print version: Loading...

      Abstract: Abstract The VeRoLog Solver Challenge 2016–2017 is the third solver challenge facilitated by VeRoLog, the EURO Working Group on Vehicle Routing and Logistics Optimization, and is organized in cooperation with ORTEC B.V. The authors constitute the organizing committee of this challenge, and with this paper they report on the problem and organization of this challenge.
      PubDate: 2018-03-01
      DOI: 10.1007/s41604-016-0001-7
       
  • Commuters’ traffic pattern and prediction analysis in a metropolitan
           area

    • Free pre-print version: Loading...

      Abstract: Abstract A metropolitan area is an area with dynamic demands and is one of the main indicators of economic growth of nation. It involves the complexity of efficient analysis and prediction of patterns of growth or decline of traffic volume and patterns of resource utilization with respect to time and place. To solve these complexities, we propose agent-based commuters’ traffic pattern and prediction analysis model in a metropolitan area. The proposed system model is capable of analyzing and predicting the patterns of commuters’ traffic flow volume and resource utilization in each zone and region, using the population density, availability of resources, type of place, time period, and commuters’ and vehicles’ arrival rates. The proposed model provides qualitative form of traffic; increases the probability of measure of unpredictable information; and aids in emergency traffic planning and route-finding services. The result shows the effectiveness of the model at different time periods in a day for forecasting of the resource utilization and changes in traffic volumes in zones and regions in the metropolitan area.
      PubDate: 2018-03-01
      DOI: 10.1007/s41604-017-0004-z
       
  • Vehicle routing problems with deliveries split over days

    • Free pre-print version: Loading...

      Abstract: Abstract In the classical (Capacitated) Vehicle Routing Problem (CVRP) we seek to use a fleet of trucks to deliver goods to customers at minimal cost, and customers’ requests must be fulfilled in a single visit. In the Split Delivery Vehicle Routing Problem (SDVRP), we are allowed to visit a customer multiple times to fulfil their demand. In this paper, we study a variant of SDVRP where customers have to be served over a multi-period horizon, and each customer may require service on one or more days. We consider the possibility of splitting a request not only between vehicles on the same day but also across consecutive days. The objective is to find a set of routes for each day of the planning horizon so that the total travelling cost is minimised, and the total amount delivered meets customers’ demand. We show that this Multi-Day version of SDVRP is structurally different to the usual SDVRP. We also consider a Fleet Size and Mix variant of the problem, where a fixed cost for using a vehicle at all during the horizon is added to the objective function. We propose a Mixed Integer Linear Programming approach to solve the Multi-Day SDVRP, together with some valid inequalities to enhance it. Furthermore, we develop a large neighbourhood search-based heuristic which provides upper bounds for the proposed mathematical formulation, which proves effective in reducing solution times. We present a theoretical study of the problem, extending some known properties of the VRP with split deliveries, and an extensive computational analysis aimed at studying the strengths and weakness of the proposed strategy.
      PubDate: 2018-03-01
      DOI: 10.1007/s41604-017-0002-1
       
  • Load transfer operations for a dynamic vehicle routing problem with mixed
           backhauls

    • Free pre-print version: Loading...

      Abstract: Abstract We consider a dynamic vehicle routing problem with mixed backhauls (DVRPMB) that seeks to plan, in the most efficient way, the delivery of dynamic pickup orders that arrive in real time, while a predefined plan of serving static delivery orders is being executed. Maintaining the original assignment of delivery orders to vehicles may limit system performance, since the changes in the system state caused by the arriving dynamic orders may grant re-assignments of such orders advantageous. Thus, in this paper, we introduce and solve a variant of DVRPMB that allows orders to be transferred between vehicles during plan implementation. We refer to this problem as the DVRPMB with load transfers (DVRPMB-LT). Since the problem is solved with periodic re-optimization, we focus on the underlying optimization problem, develop an appropriate model using an arc-based formulation, and compare the exact solutions to the ones of the corresponding problem that does not allow transfers. Furthermore, we develop a practical heuristic framework to address the complexity of DVRPMB-LT and solve cases of practical relevance. Subsequently, we employ the proposed framework to solve and analyze the full dynamic problem.
      PubDate: 2018-03-01
      DOI: 10.1007/s41604-017-0005-y
       
  • Heuristic evaluation of the characteristic function in the Cooperative
           Inventory Routing Game

    • Free pre-print version: Loading...

      Abstract: Abstract This paper is concerned with the problem of the characteristic function evaluation for the game theory model of horizontal cooperation of carriers on large transportation networks. We consider a mathematical formalization of the Cooperative Inventory Routing Game (CIRG) in the form of characteristic function. Due to non-exact evaluation of the minimal cost for the coalitions, we have the subadditivity property of the characteristic function to be not fulfilled in general case. To calculate the values of characteristic function that satisfy the subadditivity condition, the Direct Coalition Induction Algorithm (DCIA) is used. To solve the multi-depot Inventory Routing Problem for each coalition, the Dynamic Adaptation procedure for Large Neighborhood Search (ALNS) is applied. Calculation of the characteristic function vales, DCIA performance, and advantages of Dynamic Adaptation for ALNS are demonstrated with computational experiments. It is shown that an experimental level of time consistency of the solutions generated by DALNS for given IRP benchmark instances appears to be higher in average in comparison with the solutions generated by ALNS.
      PubDate: 2018-03-01
      DOI: 10.1007/s41604-017-0003-0
       
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
 


Your IP address: 3.238.72.122
 
Home (Search)
API
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-