stochastic traffic assignment

IEEE Account

• Change Username/Password
• Update Address

Purchase Details

• Payment Options
• Order History
• View Purchased Documents

Profile Information

• Communications Preferences
• Profession and Education
• Technical Interests
• US & Canada: +1 800 678 4333
• Worldwide: +1 732 981 0060
• Contact & Support
• About IEEE Xplore
• Accessibility
• Terms of Use
• Nondiscrimination Policy
• Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity. © Copyright 2024 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.

Network assignment

What is Network Assignment?

Role of Network Assignment in Travel Forecasting

Overview of Methods for Traffic Assignment for Highways

All-or-nothing Assignments

Incremental assignment

Brief History of Traffic Equilibrium Concepts

Calculating Generalized Costs from Delays

Challenges for Highway Traffic Assignment

Transit Assignment

Latest Developments

Page categories

Topic Circles

Trip Based Models

More pages in this category:

# what is network assignment.

In the metropolitan transportation planning and analysis, the network assignment specifically involves estimating travelers’ route choice behavior when travel destinations and mode of travel are known. Origin-destination travel demand are assigned to a transportation network in order to estimate traffic flows and network travel conditions such as travel time. These estimated outputs from network assignment are compared against observed data such as traffic counts for model validation .

Network assignment is a mathematical problem which is solved by a solution algorithm through the use of computer. It is usually resolved as a travel cost optimization problem for each origin-destination pair on a model network. For every origin-destination pair, a path is selected that typically minimizes travel costs. The simplest kind of travel cost is travel time from beginning to end of the trip. A more complex form of travel cost, called generalized cost, may include combinations of other costs of travel such as toll cost and auto operating cost on highway networks. Transit networks may include within generalized cost weights to emphasize out-of-vehicle time and penalties to represent onerous tasks. Usually, monetary costs of travel, such as tolls and fares, are converted to time equivalent based on an estimated value of time. The shortest path is found using a path finding algorithm .

The surface transportation network can include the auto network, bus network, passenger rail network, bicycle network, pedestrian network, freight rail network, and truck network. Traditionally, passenger modes are handled separately from vehicular modes. For example, trucks and passenger cars may be assigned to the same network, but bus riders often are assigned to a separate transit network, even though buses travel over roads. Computing traffic volume on any of these networks first requires estimating network specific origin-destination demand. In metropolitan transportation planning practice in the United States, the most common network assignments employed are automobile, truck, bus, and passenger rail. Bicycle, pedestrian, and freight rail network assignments are not as frequently practiced.

# Role of Network Assignment in Travel Forecasting

The urban travel forecasting process is analyzed within the context of four decision choices:

• Personal Daily Activity
• Locations to Perform those Activities
• Mode of Travel to Activity Locations, and
• Travel Route to the Activity Locations.

Usually, these four decision choices are named as Trip Generation , Trip Distribution , Mode Choice , and Traffic Assignment. There are variations in techniques on how these travel decision choices are modeled both in practice and in research. Generalized cost, which is typically in units of time and is an output of the path-choice step of the network assignment process, is the single most important travel input to other travel decision choices, such as where to travel and by which mode. Thus, the whole urban travel forecasting process relies heavily on network assignment. Generalized cost is also a major factor in predicting socio-demographic and spatial changes. To ensure consistency in generalized cost between all travel model components in a congested network, travel cost may be fed back to the earlier steps in the model chain. Such feedback is considered “best practice” for urban regional models. Outputs from network assignment are also inputs for estimating mobile source emissions as part of a review of metropolitan area transportation plans, a requirement under the Clean Air Act Amendments of 1990 for areas not in attainment of the National Ambient Air Quality Standard.

# Overview of Methods for Traffic Assignment for Highways

This topic deals principally with an overview of static traffic assignment. The dynamic traffic assignment is discussed elsewhere.

There are a large number of traffic assignment methods, but they all have at their core a procedure called “all-or-nothing” (AON) traffic assignment. All-or-nothing traffic assignment places all trips between an origin and destination on the shortest path between that origin and destination and no trips on any other possible path (compare path finding algorithm for a step-by-step introduction). Shortest paths may be determined by a well-known algorithm by Dijkstra; however, when there are turn penalties in the network a different algorithm, called Vine building , must be used instead.

# All-or-nothing Assignments

The simplest assignment algorithm is the all-or-nothing traffic assignment. In this algorithm, flows from every origin to every destination are assigned using the path finding algorithm , and travel time remains unchanged regardless of travel volumes.

All-or-nothing traffic assignment may be used when delays are unimportant for a network. Another alternative to the user-equilibrium technique is the stochastic traffic assignment technique, which assumes variation in link level travel time.

One of the earliest, computationally efficient stochastic traffic assignment algorithms was developed by Robert Dial. [1] More recently the k-shortest paths algorithm has gained popularity.

The biggest disadvantage of the all-or-nothing assignment and the stochastic assignment is that congestion cannot be considered. In uncongested networks, these algorithms are very useful. In congested conditions, however, these algorithm miss that some travelers would change routes to avoid congestion.

# Incremental assignment

The incremental assignment method is the simplest way to (somewhat rudimentary) consider congestion. In this method, a certain share of all trips (such as half of all trips) is assigned to the network. Then, travel times are recalculated using a volume-delay function , or VDF. Next, a smaller share (such as 25% of all trips) is assigned based using the revised travel times. Using the demand of 50% + 25%, travel times are recalculated again. Next, another smaller share of trips (such as 10% of all trips) is assigned using the latest travel times.

A large benefit of the incremental assignment is model runtime. Usually, flows are assigned within 5 to 10 iterations. Most user-equilibrium assignment methods (see below) require dozens of iterations, which increases the runtime proportionally.

In the incremental assignment, the first share of trips is assigned based on free-flow conditions. Following iterations see some congestion, on only the very last trip to be assigned will consider true congestion levels. This is reasonable for lightly congested networks, as a large number of travelers could travel at free-flow speed.

The incremental assignment works unsatisfactorily in heavily congested networks, as even 50% of the travel demand may lead to congestion on selected roads. The incremental assignment will miss the fact that a portion of the 50% is likely to select different routes.

# Brief History of Traffic Equilibrium Concepts

Traffic assignment theory today largely traces its origins to a single principle of “user equilibrium” by Wardrop [2] in 1952. Wardrop’s “first” principle simply states (slightly paraphrased) that at equilibrium not a single driver may change paths without incurring a greater travel impedance . That is, any used path between an origin and destination must have a shortest travel time between the origin and destination, and all other paths must have a greater travel impedance. There may be multiple paths between an origin and destination with the same shortest travel impedance, and all of these paths may be used.

Prior to the early 1970’s there were many algorithms that attempted to solve for Wardrop’s user equilibrium on large networks. All of these algorithms failed because they either did not converge properly or they were too slow computationally. The first algorithm to be able to consistently find a correct user equilibrium on a large traffic network was conceived by a research group at Northwestern University (LeBlanc, Morlok and Pierskalla) in 1973. [3] This algorithm was called “Frank-Wolfe decomposition” after the name of a more general optimization technique that was adapted, and it found the minimum of an “objective function” that came directly from theory attributed to Beckmann from 1956. [4] The Frank-Wolfe decomposition formulation was extended to the combined distribution/assignment problem by Evans in 1974. [5]

A lack of extensibility of these algorithms to more realistic traffic assignments prompted model developers to seek more general methods of traffic assignment. A major development of the 1980s was a realization that user equilibrium traffic assignment is a “variational inequality” and not a minimization problem. [6] An algorithm called the method of successive averages (MSA) has become a popular replacement for Frank-Wolfe decomposition because of MSA’s ability to handle very complicated relations between speed and volume and to handle the combined distribution/mode-split/assignment problem. The convergence properties of MSA were proven for elementary traffic assignments by Powell and Sheffi and in 1982. [7] MSA is known to be slower on elementary traffic assignment problems than Frank-Wolfe decomposition, although MSA can solve a wider range of traffic assignment formulations allowing for greater realism.

A number of enhancements to the overall theme of Wardop’s first principle have been implemented in various software packages. These enhancements include: faster algorithms for elementary traffic assignments, stochastic multiple paths, OD table spatial disaggregation and multiple vehicle classes.

# Calculating Generalized Costs from Delays

Equilibrium traffic assignment needs a method (or series of methods) for calculating impedances (which is another term for generalized costs) on all links (and nodes) of the network, considering how those links (and nodes) were loaded with traffic. Elementary traffic assignments rely on volume-delay functions (VDFs), such as the well-known “BPR curve” (see NCHRP Report 365), [8] that expressed travel time as a function of link volume and link capacity. The 1985 US Highway Capacity Manual (and later editions through 2010) made it clear to transportation planners that delays on large portions of urban networks occur mainly at intersections, which are nodes on a network, and that the delay on any given intersection approach relates to what is happening on all other approaches. VDFs are not suitable for situations where there is conflicting and opposing traffic that affects delays. Software for implementing trip-based models are now incorporating more sophisticated delay relationships from the Highway Capacity Manual and other sources, although many MPO forecasting models still use VDFs, exclusively.

# Challenges for Highway Traffic Assignment

Numerous practical and theoretical inadequacies pertaining to Static User Equilibrium network assignment technique are reported in the literature. Among them, most widely noted concerns and challenges are:

• Inadequate network convergence;
• Continued use of legacy slow convergent network algorithm, despite availability of faster solution methods and computers;
• Non-unique route flows and link flows for multi-class assignments and for assignment on networks that include delays from opposing and conflicting traffic;
• Continued use of VDFs , when superior delay estimation techniques are available;
• Unlikeness of a steady-state network condition;
• Impractical assumption that all drivers have flawless route information and are acting without bias;
• Every driver travels at the same congested speed, no vehicle traveling on the same link overtakes another vehicle;
• Oncoming traffic does not affect traffic flows;
• Interruptions, such as accidents or inclement weather, are not represented;
• Traffic does not form queues;
• Continued use of multi-hour time periods, when finer temporal detail gives better estimates of delay and path choice.

# Transit Assignment

Most transit network assignment in implementation is allocation of known transit network specific demand based on routes, vehicle frequency, stop location, transfer point location and running times. Transit assignments are not equilibrium, but can be either all-or-nothing or stochastic. Algorithms often use complicated expressions of generalized cost which include the different effects of waiting time, transfer time, walking time (for both access and egress), riding time and fare structures. Estimated transit travel time is not directly dependent on transit passenger volume on routes and at stations (unlike estimated highway travel times, which are dependent on vehicular volumes on roads and at intersection). The possibility of many choices available to riders, such as modes of access to transit and overlaps in services between transit lines for a portion of trip segments, add further complexity to these problems.

# Latest Developments

With the increased emphasis on assessment of travel demand management strategies in the US, there have been some notable increases in the implementation of disaggregated modeling of individual travel demand behavior. Similar efforts to simulate travel route choice on dynamic transportation network have been proposed, primarily to support the much needed realistic representation of time and duration of roadway congestion. Successful examples of a shift in the network assignment paradigm to include dynamic traffic assignment on a larger network have emerged in practice. Dynamic traffic assignments are able to follow UE principles. An even newer topic is the incorporation of travel time reliability into path building.

# References

Dial , Robert Barkley, Probabilistic Assignment; a Multipath Traffic Assignment Model Which Obviates Path Enumeration, Thesis (Ph.D.), University of Washington, 1971. ↩︎

Wardrop, J. C., Some Theoretical Aspects of Road Traffic Research, Proceedings, Institution of Civil Engineers Part 2, 9, pp. 325–378. 1952. ↩︎

LeBlanc, Larry J., Morlok, Edward K., Pierskalla, William P., An Efficient Approach to Solving the Road Network Equilibrium Traffic Assignment Problem, Transportation Research 9, 1975, 9, 309–318. ↩︎

(opens new window) ) ↩︎

Evans, Suzanne P., Derivation and Analysis of Some Models for Combining Trip Distribution and Assignment, Transportation Research, Vol 10, pp 37–57 1976. ↩︎

Dafermos, S.C., Traffic Equilibrium and Variational Inequalities, Transportation Science 14, 1980, pp. 42-54. ↩︎

Powell, Warren B. and Sheffi, Yosef, The Convergence of Equilibrium Algorithms with Predetermined Step Sizes, Transportation Science, February 1, 1982, pp. 45-55. ↩︎

(opens new window) ). ↩︎

← Mode choice Dynamic Traffic Assignment →

This site uses cookies to learn which topics interest our readers.

• DOI: 10.1287/TRSC.11.3.253
• Corpus ID: 121821965

On Stochastic Models of Traffic Assignment

• C. Daganzo , Y. Sheffi
• Published 1 August 1977
• Computer Science, Engineering
• Transportation Science

967 Citations

A probit-based stochastic user equilibrium assignment model, investigation of stochastic network loading procedures, a stochastic traffic assignment model considering differences in passengers utility functions, 21st international symposium on transportation and traffic theory on multi-objective stochastic user equilibrium, a mean-risk model for the stochastic traffic assignment problem, some observations on stochastic user equilibrium and system optimum of traffic assignment, on the existence and convergence of the markovian traffic equilibrium ∗, robust traffic assignment model: formulation, solution algorithms and empirical application.

• Highly Influenced

Traffic Assignment Methods

Some statistical problems in connection with traffic assignment, 17 references, an algorithm for the traffic assignment problem, an iterative assignment approach to capacity restraint on arterial networks, a probabilistic multipath traffic assignment model which obviates path enumeration. in: the automobile, a research program for comparison of traffic assignment techniques, interactive graphics system for transit route optimization, comparative analysis of traffic assignment techniques with actual highway use, structure of passenger travel demand models, an efficient approach to solving the road network equilibrium traffic assignment problem. in: the automobile, on the probabilistic origin of dial's multipath traffic assignment model, the greatest of a finite set of random variables, related papers.

Showing 1 through 3 of 0 Related Papers

A Stochastic Traffic Assignment Algorithm Based on Ant Colony Optimisation

• Conference paper
• Cite this conference paper

• Luca D’Acierno 22 ,
• Bruno Montella 22 &
• Fortuna De Lucia 22  

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4150))

Included in the following conference series:

• International Workshop on Ant Colony Optimization and Swarm Intelligence

3625 Accesses

15 Citations

In this paper we propose a Stochastic User Equilibrium (SUE) algorithm that can be adopted as a model, known as a simulation model, that imitates the behaviour of transportation systems. Indeed, analyses of real dimension networks need simulation algorithms that allow network conditions and performances to be rapidly determined. Hence, we developed an MSA ( Method of Successive Averages ) algorithm based on the Ant Colony Optimisation paradigm that allows transportation systems to be simulated in less time but with the same accuracy as traditional MSA algorithms. Finally, by means of Blum’s theorem, we stated theoretically the convergence of the proposed ACO-based algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save.

• Get 10 units per month
• Download Article/Chapter or eBook
• 1 Unit = 1 Article or 1 Chapter
• Cancel anytime
• Available as PDF
• Read on any device
• Instant download
• Own it forever
• Compact, lightweight edition
• Dispatched in 3 to 5 business days
• Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Unable to display preview.  Download preview PDF.

Similar content being viewed by others

Inverse Ant Algorithm

Ant Colony Optimization Algorithms with Diversified Search in the Problem of Optimization of Airtravel Itinerary

Simulation-optimization approach for the stochastic location-routing problem

Cantarella, G.E.: A general fixed-point approach to multimodal multi-user equilibrium assignment with elastic demand. Transport. Sci. 31, 107–128 (1997)

Article   MATH   Google Scholar  

Colorni, A., Dorigo, M., Maniezzo, V.: Distributed optimization by ant colonies. In: Varela, F.J., Bourgine, P. (eds.) Toward a practice of autonomous systems: Proceedings of the First European Conference on Artificial Life, pp. 134–142. The MIT Press, Cambridge (1992)

Google Scholar  

Colorni, A., Dorigo, M., Maniezzo, V.: An investigation of some properties of an ant algorithm. In: Männer, R., Manderick, B. (eds.) Proceedings of PPSN II, pp. 509–520. Elsevier, Amsterdam (1992)

Dorigo, M.: Optimization, learning and natural algorithms (in Italian). PhD thesis, Department of Electronics, Polytechnic of Milan, Italy (1992)

Dorigo, M., Stützle, T.: Ant colony optimization. The MIT Press, Cambridge (2004)

Book   MATH   Google Scholar  

Poorzahedy, H., Abulghasemi, F.: Application of ant system to network design problem. Transportation 32, 251–273 (2005)

Article   Google Scholar  

Mussone, L., Ponzi, M., Matteucci, M.: Ant colony optimization for stochastic user equilibrium. In: Bifulco, G.N. (ed.) I sistemi stradali di trasporto nella societá dell’informazione, pp. 175–199. Aracne Editrice (2005)

Frank, M., Wolfe, P.: An algorithm for quadratic programming. Nav. Res. Log. Quart. 3, 95–110 (1956)

Article   MathSciNet   Google Scholar  

Gutjahr, W.J.: A graph-based ant system and its convergence. Future Gener. Comp. Sy. 16, 873–888 (2000)

Gutjahr, W.J.: A converging ACO algorithm for stochastic combinatorial optimization. In: Albrecht, A.A., Steinhöfel, K. (eds.) SAGA 2003. LNCS, vol. 2827, pp. 10–25. Springer, Heidelberg (2003)

Chapter   Google Scholar  

Chang, H.S., Gutjahr, W.J., Yang, J., Park, S.: An ant system based approach to markov decision processes. In: Proceedings of the 2004 American Control Conference, Boston (MA), USA, pp. 3820–3825 (2004)

Dorigo, M., Blum, C.: Ant colony optimization theory: a survey. Theor. Comput. Sci. 344, 243–278 (2005)

Article   MATH   MathSciNet   Google Scholar  

Cascetta, E.: Transportation systems engineering: theory and methods. Kluwer Academic Publisher, Dordrecht (2001)

MATH   Google Scholar  

Blum, J.R.: Multidimensional stochastic approximation methods. Ann. Math. Stat. 25, 737–744 (1954)

Dial, R.B.: A probabilistic multipath traffic assignment model which obviates path enumeration. Transport. Res. 5, 83–111 (1971)

D’Acierno, L., Montella, B., Gallo, M.: Multimodal assignment to congested networks: fixed-point models and algorithms. In: Proceedings of European Transport Conference 2002, Cambridge, United Kingdom (2002)

Li, Y., Gong, S.: Dynamic ant colony optimisation for TSP. Int. J. Adv. Manuf. Tech. 22, 528–533 (2003)

Nguyen, S., Pallottino, S., Gendreau, M.: Implicit enumeration of hyperpaths in a logit model for transit networks. Transport. Sci. 32, 54–64 (1998)

Download references

Author information

Authors and affiliations.

Dept. of Transportation Engineering, ‘Federico II’ University, Naples, Italy

Luca D’Acierno, Bruno Montella & Fortuna De Lucia

You can also search for this author in PubMed   Google Scholar

Editor information

Editors and affiliations.

IRIDIA, CoDE, Université Libre de Bruxelles,,, Brussels, Belgium

Marco Dorigo

Istituto Dalle Molle di Studi sull’Intelligenza Artificiale (IDSIA), Lugano, Switzerland

Luca Maria Gambardella

IRIDIA, CoDE, Université Libre de Bruxelles, Brussels, Belgium

Mauro Birattari

Swarm-Intelligent Systems Group, École Polytechnique Fédérale de Lausanne, 1015, Lausanne, Switzerland

Alcherio Martinoli

Department of Computing and Electronic Systems, University of Essex, Wivenhoe Park, CO4 3SQ, Colchester, UK

Riccardo Poli

IRIDIA, CoDE, Université Libre de Bruxelles, Avenue F. Roosevelt 50, CP 194/6, 1050, Brussels, Belgium

Thomas Stützle

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper.

D’Acierno, L., Montella, B., De Lucia, F. (2006). A Stochastic Traffic Assignment Algorithm Based on Ant Colony Optimisation. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2006. Lecture Notes in Computer Science, vol 4150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11839088_3

Download citation

DOI : https://doi.org/10.1007/11839088_3

Publisher Name : Springer, Berlin, Heidelberg

Print ISBN : 978-3-540-38482-3

Online ISBN : 978-3-540-38483-0

eBook Packages : Computer Science Computer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

• Publish with us

Policies and ethics

• Find a journal
• Track your research

arXiv's Accessibility Forum starts next month!

Help | Advanced Search

Mathematics > Optimization and Control

Title: stochastic multi-class traffic assignment for autonomous and regular vehicles in a transportation network.

Abstract: A transition period from regular vehicles (RVs) to autonomous vehicles (AVs) is imperative. This article explores both types of vehicles using a route choice model, formulated as a stochastic multi-class traffic assignment (SMTA) problem. In RVs, cross-nested logit (CNL) models are used since drivers do not have complete information and the unique characteristics of CNL. AVs, however, are considered to behave in a user equilibrium (UE) due to complete information about the network. The main innovation of this article includes the introduction of three solution methods for SMTA. Depending on the size of the network, each method can be used. These methods include solving the nonlinear complementary problem (NCP) with GAMS software, the decomposition-assignment algorithm, and the modified Wang's algorithm. Through the modification of Wang's algorithm, we have increased the convergence speed of Wang's algorithm and shown its numerical results for the Nguyen and Sioux Falls networks. As it is not possible to consider all paths in the traffic assignment, we proposed a creative path generation-assignment (PGA) algorithm. This algorithm generates several attractive paths for each origin-destination (OD), and the modified Wang's algorithm assigns traffic flow. Keywords: Autonomous Vehicles, Stochastic Multi-class Traffic Assignment, Cross-Nested Logit Model

Submission history

Access paper:.

• Other Formats

References & Citations

• Google Scholar
• Semantic Scholar

BibTeX formatted citation

Bibliographic and Citation Tools

Code, data and media associated with this article, recommenders and search tools.

• Institution

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs .

Information

• Author Services

Initiatives

You are accessing a machine-readable page. In order to be human-readable, please install an RSS reader.

All articles published by MDPI are made immediately available worldwide under an open access license. No special permission is required to reuse all or part of the article published by MDPI, including figures and tables. For articles published under an open access Creative Common CC BY license, any part of the article may be reused without permission provided that the original article is clearly cited. For more information, please refer to https://www.mdpi.com/openaccess .

Feature papers represent the most advanced research with significant potential for high impact in the field. A Feature Paper should be a substantial original Article that involves several techniques or approaches, provides an outlook for future research directions and describes possible research applications.

Feature papers are submitted upon individual invitation or recommendation by the scientific editors and must receive positive feedback from the reviewers.

Editor’s Choice articles are based on recommendations by the scientific editors of MDPI journals from around the world. Editors select a small number of articles recently published in the journal that they believe will be particularly interesting to readers, or important in the respective research area. The aim is to provide a snapshot of some of the most exciting work published in the various research areas of the journal.

Original Submission Date Received: .

• Active Journals
• Find a Journal
• Proceedings Series
• For Authors
• For Reviewers
• For Editors
• For Librarians
• For Publishers
• For Societies
• For Conference Organizers
• Open Access Policy
• Institutional Open Access Program
• Special Issues Guidelines
• Editorial Process
• Research and Publication Ethics
• Article Processing Charges
• Testimonials
• Preprints.org
• SciProfiles
• Encyclopedia

Article Menu

• Subscribe SciFeed
• Recommended Articles
• Google Scholar
• on Google Scholar
• Table of Contents

Find support for a specific problem in the support section of our website.

Please let us know what you think of our products and services.

Visit our dedicated information section to learn more about MDPI.

JSmol Viewer

A stochastic drone-scheduling problem with uncertain energy consumption.

1. Introduction

• We study a drone-scheduling problem with the uncertainty of energy consumption. In order to promote energy efficiency and drone safety services, we considered the uncertainty of energy consumption during drone flight in order to provide efficient logistic services to customers while also ensuring drone safety.
• We have defined the above problem and constructed it as a two-stage stochastic programming model. To our knowledge, this is the first stochastic programming model to study this problem. Furthermore, we designed a fixed sample size method based on Monte Carlo simulation to characterize uncertain variables and constructed a variable neighborhood search algorithm for solving this problem.
• We have generated a series of case studies to demonstrate the superiority of our model and algorithm, as well as to evaluate the benefits of considering uncertain energy consumption. From an algorithmic perspective, the algorithm we designed is effective and superior. From a model perspective, considering uncertain energy consumption can indeed bring benefits, improve the service efficiency of drone-scheduling systems, and serve more customers.

2. Literature Review

3. Problem Formulation

3.1. problem description, 3.2. formulation, 3.3. two-stage stochastic optimization model.

4. Solution Approach

4.1. Construction Heuristic

4.2. shaking operations, 5. numerical experiments, 5.1. instance description, 5.2. computational efficiency, 5.3. advantage of considering stochasticity, 5.4. comparison analysis under different sample sizes, 6. conclusions, author contributions, data availability statement, acknowledgments, conflicts of interest.

• He, Y.; Wang, X.; Lin, Y.; Zhou, F.; Zhou, L. Sustainable decision making for joint distribution center location choice. Transp. Res. Part D Transp. Environ. 2017 , 55 , 202–216. [ Google Scholar ] [ CrossRef ]
• Liu, Y. An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones. Comput. Oper. Res. 2019 , 111 , 1–20. [ Google Scholar ] [ CrossRef ]
• Es Yurek, E. Impact of Drone Battery Recharging Policy on Overall Carbon Emissions: The Traveling Salesman Problem with Drone. Drones 2024 , 8 , 108. [ Google Scholar ] [ CrossRef ]
• Huang, H.; Savkin, A.V. Deployment of charging stations for drone delivery assisted by public transportation vehicles. IEEE Trans. Intell. Transp. Syst. 2021 , 23 , 15043–15054. [ Google Scholar ] [ CrossRef ]
• Kim, S.J.; Lim, G.J.; Cho, J.; Côté, M.J. Drone-aided healthcare services for patients with chronic diseases in rural areas. J. Abbr. 2017 , 88 , 163–180. [ Google Scholar ] [ CrossRef ]
• Liu, Y.; Shi, J.; Liu, Z.; Huang, J.; Zhou, T. Two-layer routing for high-voltage powerline inspection by cooperated ground vehicle and drone. Energies 2019 , 12 , 1385. [ Google Scholar ] [ CrossRef ]
• Dukkanci, O.; Campbell, J.F.; Kara, B.Y.T. Facility location decisions for drone delivery: A literature review. Eur. J. Oper. Res. 2024 , 316 , 397–418. [ Google Scholar ] [ CrossRef ]
• Macrina, G.; Pugliese, L.D.P.; Guerriero, F.; Laporte, G. Drone-aided routing: A literature review. Transp. Res. Part C Emerg. Technol. 2020 , 120 , 102762. [ Google Scholar ] [ CrossRef ]
• Kim, D.; Lee, K.; Moon, I. Stochastic facility location model for drones considering uncertain flight distance. Ann. Oper. Res. 2019 , 283 , 1283–1302. [ Google Scholar ] [ CrossRef ]
• Huang, H.; Hu, C.; Zhu, J.; Wu, M.; Malekian, R. Stochastic task scheduling in UAV-based intelligent on-demand meal delivery system. IEEE Trans. Intell. Transp. Syst. 2021 , 23 , 13040–13054. [ Google Scholar ] [ CrossRef ]
• Cheng, C.; Adulyasak, Y.; Rousseau, L.-M. Drone routing with energy function: Formulation and exact algorithm. J. Abbr. 2020 , 139 , 364–387. [ Google Scholar ] [ CrossRef ]
• Pasha, J.; Elmi, Z.; Purkayastha, S.; Fathollahi-Fard, A.M.; Ge, Y.-E.; Lau, Y.-Y.; Dulebenets, M.A. The drone scheduling problem: A systematic state-of-the-art review. IEEE Trans. Intell. Transp. Syst. 2022 , 23 , 14224–14247. [ Google Scholar ] [ CrossRef ]
• Yildiz, B.; Savelsbergh, M. Provably high-quality solutions for the meal delivery routing problem. Transp. Sci. 2019 , 53 , 1372–1388. [ Google Scholar ] [ CrossRef ]
• Simoni, M.D.; Winkenbach, M. Crowdsourced on-demand food delivery: An order batching and assignment algorithm. Transp. Res. Part C Emerg. Technol. 2023 , 149 , 104055. [ Google Scholar ] [ CrossRef ]
• Ioannidis, C.; Boutsi, A.-M.; Tsingenopoulos, G.; Soile, S.; Chliverou, R.; Potsiou, C. Paving the Way for Last-Mile Delivery in Greece: Data-Driven Performance Analysis with a Customized Quadrotor. Drones 2023 , 8 , 6. [ Google Scholar ] [ CrossRef ]
• Yu, N.; Dong, B.; Qu, Y.; Zhang, M.; Wang, Y.; Dai, H.; Yao, C. Drones Routing with Stochastic Demand. Drones 2023 , 7 , 362. [ Google Scholar ] [ CrossRef ]
• Glick, T.B.; Figliozzi, M.A.; Unnikrishnan, A. Case study of drone delivery reliability for time-sensitive medical supplies with stochastic demand and meteorological conditions. Transp. Res. Rec. 2022 , 2676 , 242–255. [ Google Scholar ] [ CrossRef ]
• Hamdi, A.; Salim, F.D.; Kim, D.Y.; Neiat, A.G.; Bouguettaya, A. Drone-as-a-service composition under uncertainty. IEEE Trans. Serv. Comput. 2021 , 15 , 2685–2698. [ Google Scholar ] [ CrossRef ]
• Wang, X.; Jiang, R.; Qi, M. A robust optimization problem for drone-based equitable pandemic vaccine distribution with uncertain supply. Omega 2023 , 119 , 102872. [ Google Scholar ] [ CrossRef ] [ PubMed ]
• Li, B.; Krushinsky, D.; Van Woensel, T.; Reijers, H.A. The share-a-ride problem with stochastic travel times and stochastic delivery locations. Transp. Res. Part C Emerg. Technol. 2016 , 67 , 95–108. [ Google Scholar ] [ CrossRef ]
• Lyu, J.; He, Y. A two-stage hybrid metaheuristic for a low-carbon vehicle routing problem in hazardous chemicals road transportation. Appl. Sci. 2021 , 11 , 4864. [ Google Scholar ] [ CrossRef ]
• Zhou, F.; He, Y.; Zhou, L. Last mile delivery with stochastic travel times considering dual services. IEEE Access 2019 , 7 , 159013–159021. [ Google Scholar ] [ CrossRef ]
• Zhou, F.; He, Y.; Ma, P.; Lim, M.K.; Pratap, S. Capacitated disassembly scheduling with random demand and operation time. J. Oper. Res. Soc. 2022 , 73 , 1362–1378. [ Google Scholar ] [ CrossRef ]
• He, Y.; Qi, M.; Zhou, F.; Su, J. An effective metaheuristic for the last mile delivery with roaming delivery locations and stochastic travel times. Comput. Ind. Eng. 2020 , 145 , 106513. [ Google Scholar ] [ CrossRef ]
• He, Y.; Wang, X.; Zhou, F.; Lin, Y. Dynamic vehicle routing problem considering simultaneous dual services in the last mile delivery. Kybernetes 2020 , 49 , 1267–1284. [ Google Scholar ] [ CrossRef ]
• Mladenović, N.; Hansen, P. Variable neighborhood search. Comput. Oper. Res. 1997 , 24 , 1097–1100. [ Google Scholar ] [ CrossRef ]

Click here to enlarge figure

Share and Cite

He, Y.; Zheng, Z.; Li, H.; Deng, J. A Stochastic Drone-Scheduling Problem with Uncertain Energy Consumption. Drones 2024 , 8 , 430. https://doi.org/10.3390/drones8090430

He Y, Zheng Z, Li H, Deng J. A Stochastic Drone-Scheduling Problem with Uncertain Energy Consumption. Drones . 2024; 8(9):430. https://doi.org/10.3390/drones8090430

He, Yandong, Zhong Zheng, Huilin Li, and Jie Deng. 2024. "A Stochastic Drone-Scheduling Problem with Uncertain Energy Consumption" Drones 8, no. 9: 430. https://doi.org/10.3390/drones8090430

Article Metrics

Article access statistics, further information, mdpi initiatives, follow mdpi.

Subscribe to receive issue release notifications and newsletters from MDPI journals

Category : Settlements in Krasnodar Krai

Instance of
Category combines topics
Krasnodar Krai
image   flag image   coat of arms image   locator map image
Instance of
Part of
Location
Located in or next to body of water	(northwest) (southwest)
Capital
Legislative body
Official language
Anthem
Head of government	(2005–)
Inception
Population
Area
Different from
Authority file   Federal subjects of the Russian Federation: With some located near or on the Black Sea and near or in the Category:Western Caucasus mountains. Sites of the 2014 Winter Olympics . Subcategories This category has the following 6 subcategories, out of 6 total. Settlements in Krasnodar Krai by name ‎ (142 C) Cities in Krasnodar Krai ‎ (17 C) Villages in Krasnodar Krai ‎ (2 C, 4 F) Coats of arms of cities and villages of Krasnodar Krai ‎ (12 C, 219 F) Flags of cities and villages of Krasnodar Krai ‎ (7 C, 1 P, 399 F) Village signs in Krasnodar Krai ‎ (1 C, 1 F) Media in category "Settlements in Krasnodar Krai" The following 23 files are in this category, out of 23 total. Geography of Krasnodar Krai Populated places in Russia by region Uses of Wikidata Infobox Uses of Wikidata Infobox with subinfoboxes Uses of Wikidata Infobox with maps Pages with coordinates Navigation menu 197 IMAGES (PDF) A Day-to-Day Stochastic Traffic Flow Assignment Model Based on Stochastic Modeling of Traffic Flow Breakdown for Predicting Travel PPT UNSW CVEN4402: Stochastic User Equilibrium (SUE) traffic assignment (part 2) PPT Mod 6, Part 4: Traffic Assignment (Stochastic Method) COMMENTS On Stochastic Models of Traffic Assignment Abstract. This paper contains a quantitative evaluation of probabilistic traffic assignment models and proposes an alternate formulation. First, the concept of stochastic-user-equilibration (S-U-E) is formalized as an extension of Wardrop's user-equilibration criterion. Then, the stochastic-network-loading (S-N-L) problem (a special case of S-U ... A Revised Logit Model for Stochastic Traffic Assignment With a The optimal value of the embedded dispersion parameter in the logit-based stochastic traffic assignment (STA) model significantly impacts predicted network flows. It also varies dramatically for different systems. This prevents its application, especially when real-world network flow data are unavailable for model calibration. To address the problem, this article proposes a revised logit model ... Stochastic Traffic Assignment Stochastic traffic assignments have been used primarily in academic research, and are rarely used in practice. Patriksson (1994) (opens new window) covers the topic in much detail. This site uses cookies to learn which topics interest our readers. Stochastic traffic assignment, Lagrangian dual, and unconstrained For illustration purpose, we choose the logit-based SSO and SUE problems as two stochastic traffic assignment examples in this comparison. Most of the previous studies for stochastic traffic assignment problems are based on Fisk's logit-based SUE model (Fisk, 1980), which is a special case of the primal formulation, as we showed in Section 3 ... A Stochastic Traffic Assignment Model for Transportation Network A Stochastic Traffic Assignment Model for Transportation Network Abstract: Traffic information in the future is likely to be available to all parts of a transportation network, and there will be various futuristic optimization models for traffic engineering. Assuming that the system can access statistical information of the aggregated traffic ... Stochastic Assignment to Transportation Networks: Models and ... Abstract. Traffic assignment to transportation networks expresses the relation between origin-destination demand flows and link flows on a transportation network, and resulting performances, such as travel times, saturation degrees, etc. Traffic assignment models are one of the basic tools for the analysis and design of transportation systems. A Reliability-Based Stochastic Traffic Assignment Model for Network This paper presents a novel reliability-based stochastic user equilibrium traffic assignment model in view of the day-to-day demand fluctuations for multi-class transportation networks. In the model, each class of travelers has a different safety margin for on-time arrival in response to the stochastic travel times raised from demand variations. Travelers' perception errors on travel time are ... Formulating the within-day dynamic stochastic traffic assignment This study proposes a formulation of the within-day dynamic stochastic traffic assignment problem. Considering the stochastic nature of route choice behavior, we treat the solution to the assignment problem as the conditional joint distribution of route traffic, given that the network is in dynamic stochastic user equilibrium. Stochastic Dynamic Traffic Assignment Model under ... Stochastic Dynamic Traffic Assignment (SDTA) based the variational inequality formulation has received increasing attention recently [11]. Moreover, some researchers focus on the improvement of the algorithm efficiency, which can provide support for the big data and complex network [9,12]. Zhao and Huang introduced the concept of satisfaction ... Network assignment Another alternative to the user-equilibrium technique is the stochastic traffic assignment technique, which assumes variation in link level travel time. One of the earliest, computationally efficient stochastic traffic assignment algorithms was developed by Robert Dial. More recently the k-shortest paths algorithm has gained popularity. On Stochastic Models of Traffic Assignment The network loading process of stochastic traffic assignment is investigated, and three logit-family models are investigated: the C-logit model, which was specifically defined for route choice; and two general discrete-choice models, the cross-nested logit models and the paired combinatorial logit model. Expand. 137. A stochastic process traffic assignment model considering stochastic In this study, a stochastic process traffic assignment model is presented to consider stochastic traffic demand. The traffic demand is assumed to be comprised of two groups of travelers: commuters with fixed traffic demand and irregular travelers with discrete random demand. With mild conditions, it is proved that our stochastic process traffic ... [2312.00848] Perturbed utility stochastic traffic assignment View a PDF of the paper titled Perturbed utility stochastic traffic assignment, by Rui Yao and 3 other authors. This paper develops a fast algorithm for computing the equilibrium assignment with the perturbed utility route choice (PURC) model. Without compromise, this allows the significant advantages of the PURC model to be used in large-scale ... A Stochastic Traffic Assignment Algorithm Based on Ant Colony Abstract. In this paper we propose a Stochastic User Equilibrium (SUE) algorithm that can be adopted as a model, known as a simulation model, that imitates the behaviour of transportation systems. Indeed, analyses of real dimension networks need simulation algorithms that allow network conditions and performances to be rapidly determined. [2212.05495] Stochastic Multi-class Traffic Assignment for Autonomous A transition period from regular vehicles (RVs) to autonomous vehicles (AVs) is imperative. This article explores both types of vehicles using a route choice model, formulated as a stochastic multi-class traffic assignment (SMTA) problem. In RVs, cross-nested logit (CNL) models are used since drivers do not have complete information and the unique characteristics of CNL. AVs, however, are ... Stochastic traffic assignment, Lagrangian dual, and unconstrained A primal formulation for stochastic traffic assignment problems. Recently, Maher et al. (2005) presented a convex programming formulation for the SSO traffic assignment problem and showed that the DSO problem is a special case of this more general problem when the travel cost randomness vanishes. PDF Traffic Assignment for Risk Averse Drivers in a Stochastic Network Stochastic User Equilibrium (DN-SUE), Stochastic Network-Deterministic User Equilibrium (SN-DUE), Stochastic Network-Stochastic User Equilibrium (SN-SUE) (1,2). The DN-DUE is the simplest, the easiest to understand, and the most widely used traffic assignment model in practice. This model was originally formulated by Beckman et al. (3) and UNSW CVEN4402: Stochastic User Equilibrium (SUE) traffic assignment This lecture introduces you to the definition of Stochastic User Equilibrium (SUE), route choice modelling with random utility theory, and logit model.This i... Drones In this paper, we present a stochastic drone-scheduling problem where the energy consumption of drones between any two nodes is uncertain. Considering uncertain energy consumption as opposed to deterministic energy consumption can effectively enhance the safety of drone flights. To address this issue, we developed a two-stage stochastic programming model with recourse cost, and we employed a ... Kropotkin, Krasnodar Krai 03618101001. Website. www .gorod-kropotkin .ru. Kropotkin ( Russian: Кропо́ткин) is a town in Krasnodar Krai, Russia, located on the right bank of the Kuban River . Stochastic Traffic Assignment Considering Road Guidance Information A Logit-based stochastic traffic assignment method considering the acceptance of traffic information is proposed to evaluate the impact of road guidance information on flow patterns. Travelers are divided into two groups by market penetration, namely, one group following the guidance information and the other choosing routes normally for which ... Category:Settlements in Krasnodar Krai Media in category "Settlements in Krasnodar Krai" The following 23 files are in this category, out of 23 total. Krasnodar Map Krasnodar. Krasnodar is the capital of Krasnodar Krai in southern Russia, with a popolulation in 2018 of just under 900,000. Its main industries are based on agriculture and food. Ukraine is facing shortages in its brave fight to survive. Please support Ukraine, because Ukraine defends a peaceful, free and democratic world. Krasnodar Krai Krasnodar Krai is located in the southwestern part of the North Caucasus and borders Rostov Oblast in the northeast, Stavropol Krai and Karachay-Cherkessia in the east, and with the Abkhazia region (internationally recognized as part of Georgia) in the south. [14] The Republic of Adygea is completely encircled by the krai territory. The krai's Taman Peninsula is situated between the Sea of ... assignment essay homework phd report resume review speech thesis