Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
A search acceleration method for optimization problems with transport simulation constraints
KTH, Skolan för arkitektur och samhällsbyggnad (ABE), Transportvetenskap, Systemanalys och ekonomi.
2017 (engelsk)Inngår i: Transportation Research Part B: Methodological, ISSN 0191-2615, Vol. 98, s. 1339-1351Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

This work contributes to the rapid approximation of solutions to optimization problems that are constrained by iteratively solved transport simulations. Given an objective function, a set of candidate decision variables and a black-box transport simulation that is solved by iteratively attaining a (deterministic or stochastic) equilibrium, the proposed method approximates the best decision variable out of the candidate set without having to run the transport simulation to convergence for every single candidate decision variable. This method can be inserted into a broad class of optimization algorithms or search heuristics that implement the following logic: (i) Create variations of a given, currently best decision variable, (ii) identify one out of these variations as the new currently best decision variable, and (iii) iterate steps (i) and (ii) until no further improvement can be attained. A probabilistic and an asymptotic performance bound are established and exploited in the formulation of an efficient heuristic that is tailored towards tight computational budgets. The efficiency of the method is substantiated through a comprehensive simulation study with a non-trivial road pricing problem. The method is compatible with a broad range of simulators and requires minimal parametrization.

sted, utgiver, år, opplag, sider
Elsevier, 2017. Vol. 98, s. 1339-1351
Emneord [en]
Budget control, Computation theory, Computational efficiency, Constrained optimization, Decision making, Heuristic algorithms, Heuristic methods, Optimization, Stochastic systems, Traffic control, Transportation charges, Acceleration method, Asymptotic performance, Computational budget, Objective functions, Optimization algorithms, Optimization problems, Simulation studies, Transport simulation
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-200856DOI: 10.1016/j.trb.2016.12.009ISI: 000400037700013Scopus ID: 2-s2.0-85009861496OAI: oai:DiVA.org:kth-200856DiVA, id: diva2:1071142
Merknad

QC 20170203

Tilgjengelig fra: 2017-02-03 Laget: 2017-02-03 Sist oppdatert: 2017-05-23bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Søk i DiVA

Av forfatter/redaktør
Flötteröd, Gunnar
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 148 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf