Filters








4,381 Hits in 8.6 sec

The Time-Dependent Vehicle Routing Problem with Time Windows and Road-Network Information

Hamza Ben Ticha, Nabil Absi, Dominique Feillet, Alain Quilliot, Tom Van Woensel
2021 SN Operations Research Forum  
We consider the Time-Dependent Vehicle Routing Problem with Time Windows and solve it with a branch-and-price algorithm.  ...  As far as we know, this is the first exact approach for a time-dependent vehicle routing problem when travel time functions are initially defined on the segments of a road-network.  ...  The authors thank the reviewers for their comments that permitted to greatly improve the quality of this paper. Compliance with Ethical Standards  ... 
doi:10.1007/s43069-020-00049-6 fatcat:5xeiyo6asbeldapcze2walqnqm

An Android Application to Find Efficient Way for Courier Services

Mr. Rahul Lohar
2018 International Journal for Research in Applied Science and Engineering Technology  
One thing that's solely attainable with a traveller service. Traveller firms area unit the best tool for people who work from home either full time or simply often.  ...  A traveller company is one that delivers messages and packages is thought for his or her speed, security, chase service and specialization.  ...  Paper5: A branch-and-cut-and price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows.  ... 
doi:10.22214/ijraset.2018.3286 fatcat:lxokxfu54nghjlyxo7o3qkb2t4

Smart Routing: A Novel Application of Collaborative Path-Finding to Smart Parking Systems

Callum Rhodes, William Blewitt, Craig Sharp, Gary Ushaw, Graham Morgan
2014 2014 IEEE 16th Conference on Business Informatics  
We simulate a smart parking system for an urban environment, and show that a novel approach to collaboratively planning paths for multiple agents can lead to reduced traffic congestion on routes toward  ...  We simulate a smart parking system for an urban environment, and show that a novel approach to collaboratively planning paths for multiple agents can lead to reduced traffic congestion on routes toward  ...  Future work in this area shall explore the application of the prototype engineering solution to large road network segments, drawn from cities noted for their traffic flow issues.  ... 
doi:10.1109/cbi.2014.22 dblp:conf/wecwis/RhodesBSUM14 fatcat:iws6eoqn7be3rft5bd5tpufyvm

A Formal Approach for Efficient Navigation Management of Hybrid Electric Vehicles on Long Trips [article]

Mohammad Ashiqur Rahman, Md Hasan Shahriar, Ehab Al-Shaer, Quanyan Zhu
2019 arXiv   pre-print
The model is solved to provide a driver with a comprehensive routing plan including the potential recharging and refueling points that satisfy the given requirements, particularly the maximum fuel cost  ...  PHEVs allow the driver to use electric power exclusively for driving and then switch to gasoline as needed. The more gasoline a vehicle uses, the higher cost is required for the trip.  ...  As we look for one satisfiable navigation route, the parent process keeps checking if a process ends (Lines 8 and 9) .  ... 
arXiv:1907.00540v1 fatcat:ozcadpzp6jho7ksctl2eijwcva

Joint routing and pricing control in congested mixed autonomy networks [article]

Mohammadhadi Mansourianfar, Ziyuan Gu, S. Travis Waller, Meead Saberi
2021 arXiv   pre-print
Routing controllability of connected and autonomous vehicles (CAVs) has been shown to reduce the adverse effects of selfish routing on the network efficiency.  ...  ) seeking human-driven vehicles (HVs) are subject to a congestion charge.  ...  From the modeling perspective, the second-best pricing problem has been modeled widely as a bi-level optimization problem or equivalently mathematical programming with equilibrium constraints (MPEC) (  ... 
arXiv:2009.10907v2 fatcat:wxsi52eh55dojpe354exub56a4

A practical model of routing problems for automated guided vehicles with acceleration and deceleration

Tatsushi NISHI, Susumu MATSUSHITA, Takeshi HISANO, Masashi MORIKAWA
2014 Journal of Advanced Mechanical Design, Systems, and Manufacturing  
We consider an optimization of conflict-free routing problems for automated guided vehicles (AGV) with acceleration and deceleration.  ...  The dominance relation for acceleration and deceleration is addressed. In the proposed model, the dynamics of real speed AGV model are reflected into the routing problems.  ...  Step 3: Solve the pricing problem Solve pricing problem and generate the routing for each vehicle with a minimum reduced cost.  ... 
doi:10.1299/jamdsm.2014jamdsm0067 fatcat:ipriht5znveg7j7xtifczl5lea

Intelligent Transportation System [chapter]

2001 Transportation Engineering Basics  
timesaving and safe route.  ...  To serve this information need, Advanced Traveler Information Systems (ATIS) that provide real-time pre-trip and en route traveler information are introduced to help drivers avoid congestion and choose  ...  Police check points contributes to traffic congestion iv.  ... 
doi:10.1061/9780784404645.ch20 fatcat:2mlbm6fvezb6dctswx3v3e35uy

Benefits of in-vehicle consolidation in less than truckload freight transportation operations

Rodrigo Mesa-Arango, Satish V. Ukkusuri
2013 Transportation Research Part E: Logistics and Transportation Review  
Consolidated bids are constructed using a multi-commodity one-to-one pickup-and-delivery vehicle routing problem that is solved using a branch-and-price algorithm.  ...  These bids are constructed considering direct shipments (Truckload operations) and several biding advisory models have been proposed for this purpose.  ...  For example, for a carrier serving the shipment charged with a price following the route , the total profit associated with this shipment is , where is the total cost related to the operation of route  ... 
doi:10.1016/j.tre.2013.05.007 fatcat:p3lcldeumnct7g6vvck3nt2szm

Benefits of in-Vehicle Consolidation in Less than Truckload Freight Transportation Operations

Rodrigo Mesa-Arango, Satish V. Ukkusuri
2013 Procedia - Social and Behavioral Sciences  
Consolidated bids are constructed using a multi-commodity one-to-one pickup-and-delivery vehicle routing problem that is solved using a branch-and-price algorithm.  ...  These bids are constructed considering direct shipments (Truckload operations) and several biding advisory models have been proposed for this purpose.  ...  For example, for a carrier serving the shipment charged with a price following the route , the total profit associated with this shipment is , where is the total cost related to the operation of route  ... 
doi:10.1016/j.sbspro.2013.05.031 fatcat:4qd6fns3bbbtnopzqywgbrvngy

Fuel emissions optimization in vehicle routing problems with time-varying speeds

Jiani Qian, Richard Eglese
2016 European Journal of Operational Research  
The problem considered in this paper is to produce routes and schedules for a fleet of delivery vehicles that minimize the fuel emissions in a road network where speeds depend on time.  ...  In the model, the route for each vehicle must be determined, and also the speeds of the vehicles along each road in their paths are treated as decision variables.  ...  Acknowledgment The first author was sponsored by the LANCS Initiative (EPSRC); Grant number: EP/F033613/1.  ... 
doi:10.1016/j.ejor.2015.09.009 fatcat:xqy5ptso6re4pmuyz2uq6mjfta

Minimum cost VRP with time-dependent speed data and congestion charge

Liang Wen, Richard Eglese
2015 Computers & Operations Research  
A heuristic algorithm, called LANCOST, is introduced for vehicle routing and scheduling problems to minimize the total travel cost, where the total travel cost includes fuel cost, driver cost and congestion  ...  The variation in speed is caused by congestion which is greatest during morning and evening rush hours. If a vehicle enters the congestion charge zone at any time, a fixed charge is applied.  ...  Model formulation and algorithm design Model formulation The problem considered is a conventional single-depot Vehicle Routing Problem with Time Windows in a time dependent road network.  ... 
doi:10.1016/j.cor.2014.10.007 fatcat:rfdsppukzbh27jrdkhayykw3ha

The multi-period vehicle routing problem with refueling decisions: Traveling further to decrease fuel cost?

Fábio Neves-Moreira, Mário Amorim-Lopes, Pedro Amorim
2020 Transportation Research Part E: Logistics and Transportation Review  
We propose a novel mathematical formulation and develop branch-and-cut and matheuristic algorithms to efficiently tackle this problem.  ...  Most vehicle routing approaches disregard the need to refuel fleets.  ...  Acknowledgements This research was partly supported by the PhD grant SFRH/BD/108251/2015, awarded by the Portuguese Foundation for Science and Technology (FCT).  ... 
doi:10.1016/j.tre.2019.11.011 fatcat:mvnntm4agfcsbiporzv6ysuw6e

The role of operational research in green freight transportation

Tolga Bektaş, Jan Fabian Ehmke, Harilaos N. Psaraftis, Jakob Puchinger
2018 European Journal of Operational Research  
The particular focus is on studies that have been described for two heavily used modes for transporting freight across the globe, namely road (including urban and electric vehicles) and maritime transportation  ...  The field of Operational Research (OR) has, particularly in the recent years, continued to contribute to alleviating the negative impacts through the use of various optimization models and solution techniques  ...  Acknowledgements This work was supported in part with public funding within the scope of the French Program "Investissements d'Avenir" and by an internal grant at the Technical University of Denmark.  ... 
doi:10.1016/j.ejor.2018.06.001 fatcat:blylux2mtvfjpcip2p2zlmatjm

The last-mile vehicle routing problem with delivery options

Christian Tilk, Katharina Olkis, Stefan Irnich
2021 OR spectrum  
To solve the VRPDO exactly, we present a new branch-price-and-cut algorithm.  ...  In the classical vehicle routing problem (VRP) with time windows, each customer request has only one location and one time window describing where and when shipments need to be delivered.  ...  Acknowledgements We thank the anonymous reviewers for their helpful comments and, in particular, for pointing us to some recent and relevant literature.  ... 
doi:10.1007/s00291-021-00633-0 fatcat:gimtt6v2zfbhzlq6bgwyiikee4

The time-dependent pickup and delivery problem with time windows

Peng Sun, Lucas P. Veelenturf, Mike Hewitt, Tom Van Woensel
2018 Transportation Research Part B: Methodological  
Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of  ...  accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the  ...  Acknowledgments The authors gratefully acknowledge funds provided by China Scholarship Council (CSC) under Grant No.201206160092 and the German Research Foundation (DFG, project GO 1841/5-1).  ... 
doi:10.1016/j.trb.2018.07.002 fatcat:pcwbkj2vcnagtk7fo6czuguceu
« Previous Showing results 1 — 15 out of 4,381 results