741 research outputs found

    Some Computational Insights on the Optimal Bus Transit Route Network Design Problem

    Get PDF
    The objective of this paper is to present some computational insights based on previous extensive research experiences on the optimal bus transit route network design problem (BTRNDP) with zonal demand aggregation and variable transit demand. A multi-objective, nonlinear mixed integer model is developed. A general meta-heuristics-based solution methodology is proposed. Genetic algorithms (GA), simulated annealing (SA), and a combination of the GA and SA are implemented and compared to solve the BTRNDP. Computational results show that zonal demand aggregation is necessary and combining metaheuristic algorithms to solve the large scale BTRNDP is very promising

    A Bilevel Approach to Frequency Optimization in Public Transportation Systems

    Get PDF
    We consider the problem of frequency optimization in transit systems, whose objective is to determine the time interval between subsequent buses for a set of public transportation lines. We extend an existing single level model by adding a constraint on bus capacities, while maintaining user choice on routes by means of an assignment sub-model. The resulting formulation is bilevel, and is transformed into a mixed integer linear programming formulation (MILP) that can be solved to optimality for small-sized problem instances, using standard MILP techniques. We study different variants of the same formulation to better understand the bilevel nature of the model and its application to real settings

    A Tabu Search Based Metaheuristic for Dynamic Carpooling Optimization

    Get PDF
    International audienceThe carpooling problem consists in matching a set of riders' requests with a set of drivers' offers by synchronizing their origins, destinations and time windows. The paper presents the so-called Dynamic Carpooling Optimization System (DyCOS), a system which supports the automatic and optimal ridematching process between users on very short notice or even en-route. Nowadays, there are numerous research contributions that revolve around the carpooling problem, notably in the dynamic context. However, the problem's high complexity and the real time aspect are still challenges to overcome when addressing dynamic carpooling. To counter these issues, DyCOS takes decisions using a novel Tabu Search based metaheuristic. The proposed algorithm employs an explicit memory system and several original searching strategies developed to make optimal decisions automatically. To increase users' satisfaction, the proposed metaheuristic approach manages the transfer process and includes the possibility to drop off the passenger at a given walking distance from his destination or at a transfer node. In addition, the detour concept is used as an original aspiration process, to avoid the entrapment by local solutions and improve the generated solution. For a rigorous assessment of generated solutions , while considering the importance and interaction among the optimization criteria, the algorithm adopts the Choquet integral operator as an aggregation approach. To measure the effectiveness of the proposed method, we develop a simulation environment based on actual carpooling demand data from the metropolitan area of Lille in the north of France

    Modelling Dry Port Systems in the Framework of Inland Waterway Container Terminals

    Get PDF
    Overcoming the global sustainability challenges of logistics requires applying solutions that minimize the negative effects of logistics activities. The most efficient way of doing so is through intermodal transportation (IT). Current IT systems rely mostly on road, rail, and sea transport, not inland waterway transport. Developing dry port (DP) terminals has been proven as a sustainable means of promoting and utilizing IT in the hinterland of seaport container terminals. Conventional DP systems consolidate container flows from/to seaports and integrate road and rail transportation modes in the hinterland which improves the sustainability of the whole logistics system. In this article, to extend literature on the sustainable development of different categories of IT terminals, especially DPs, and their varying roles, we examine the possibility of developing DP terminals within the framework of inland waterway container terminals (IWCTs). Establishing combined road–rail–inland waterway transport for observed container flows is expected to make the IT systems sustainable. As such, this article is the first to address the modelling of such DP systems. After mathematically formulating the problem of modelling DP systems, which entailed determining the number and location of DP terminals for IWCTs, their capacity, and their allocation of container flows, we solved the problem with a hybrid metaheuristic model based on the Bee Colony Optimisation (BCO) algorithm and the measurement of alternatives and ranking according to compromise solution (i.e., MARCOS) multi-criteria decision-making method. The results from our case study of the Danube region suggest that planning and developing DP terminals in the framework of IWCTs can indeed be sustainable, as well as contribute to the development of logistics networks, the regionalisation of river ports, and the geographic expansion of their hinterlands. Thus, the main contributions of this article are in proposing a novel DP concept variant, mathematically formulating the problems of its modelling, and developing an encompassing hybrid metaheuristic approach for treating the complex nature of the problem adequately
    • …
    corecore