Neural Networks Applied to Microsimulation: A Prediction Model for Pedestrian Crossing Time
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Alessandro Severino & Giuseppina Pappalardo & Salvatore Curto & Salvatore Trubia & Isaac Oyeyemi Olayode, 2021. "Safety Evaluation of Flower Roundabout Considering Autonomous Vehicles Operation," Sustainability, MDPI, vol. 13(18), pages 1-14, September.
- Chengyuan Mao & Lewen Bao & Shengde Yang & Wenjiao Xu & Qin Wang, 2021. "Analysis and Prediction of Pedestrians’ Violation Behavior at the Intersection Based on a Markov Chain," Sustainability, MDPI, vol. 13(10), pages 1-15, May.
- Irena Ištoka Otković & Aleksandra Deluka-Tibljaš & Sanja Šurdonja & Tiziana Campisi, 2021. "Development of Models for Children—Pedestrian Crossing Speed at Signalized Crosswalks," Sustainability, MDPI, vol. 13(2), pages 1-18, January.
- Li, Weigang & Liu, Jian, 2023. "Analysis of the evolution of pedestrian crossing based on dynamic penalty mechanism," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 623(C).
- Irena Ištoka Otković & Barbara Karleuša & Aleksandra Deluka-Tibljaš & Sanja Šurdonja & Mario Marušić, 2021. "Combining Traffic Microsimulation Modeling and Multi-Criteria Analysis for Sustainable Spatial-Traffic Planning," Land, MDPI, vol. 10(7), pages 1-26, June.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Chou, Jui-Sheng & Truong, Dinh-Nhat, 2021. "A novel metaheuristic optimizer inspired by behavior of jellyfish in ocean," Applied Mathematics and Computation, Elsevier, vol. 389(C).
- Thibaud Deguilhem & Juliette Schlegel & Jean-Philippe Berrou & Ousmane Djibo & Alain Piveteau, 2024. "Too many options: How to identify coalitions in a policy network?," Post-Print hal-04689665, HAL.
- Anurag Agarwal, 2009. "Theoretical insights into the augmented-neural-network approach for combinatorial optimization," Annals of Operations Research, Springer, vol. 168(1), pages 101-117, April.
- Mohammad Javad Feizollahi & Igor Averbakh, 2014. "The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 321-335, May.
- Nha Vo‐Thanh & Hans‐Peter Piepho, 2023. "Generating designs for comparative experiments with two blocking factors," Biometrics, The International Biometric Society, vol. 79(4), pages 3574-3585, December.
- Сластников С.А., 2014. "Применение Метаэвристических Алгоритмов Для Задачи Маршрутизации Транспорта," Журнал Экономика и математические методы (ЭММ), Центральный Экономико-Математический Институт (ЦЭМИ), vol. 50(1), pages 117-126, январь.
- H. A. J. Crauwels & C. N. Potts & L. N. Van Wassenhove, 1998. "Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 10(3), pages 341-350, August.
- C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
- Nair, D.J. & Grzybowska, H. & Fu, Y. & Dixit, V.V., 2018. "Scheduling and routing models for food rescue and delivery operations," Socio-Economic Planning Sciences, Elsevier, vol. 63(C), pages 18-32.
- Cazzaro, Davide & Fischetti, Martina & Fischetti, Matteo, 2020. "Heuristic algorithms for the Wind Farm Cable Routing problem," Applied Energy, Elsevier, vol. 278(C).
- İbrahim Muter & Ş. İlker Birbil & Güvenç Şahin, 2010. "Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 22(4), pages 603-619, November.
- Kadri Sylejmani & Jürgen Dorn & Nysret Musliu, 2017. "Planning the trip itinerary for tourist groups," Information Technology & Tourism, Springer, vol. 17(3), pages 275-314, September.
- Huang, Yeran & Yang, Lixing & Tang, Tao & Gao, Ziyou & Cao, Fang, 2017. "Joint train scheduling optimization with service quality and energy efficiency in urban rail transit networks," Energy, Elsevier, vol. 138(C), pages 1124-1147.
- B Dengiz & C Alabas-Uslu & O Dengiz, 2009. "Optimization of manufacturing systems using a neural network metamodel with a new training approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1191-1197, September.
- S-W Lin & K-C Ying, 2008. "A hybrid approach for single-machine tardiness problems with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1109-1119, August.
- J-F Chen & T-H Wu, 2006. "Vehicle routing problem with simultaneous deliveries and pickups," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(5), pages 579-587, May.
- Joseph B. Mazzola & Robert H. Schantz, 1997. "Multiple‐facility loading under capacity‐based economies of scope," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(3), pages 229-256, April.
- Kadri Sylejmani & Jürgen Dorn & Nysret Musliu, 0. "Planning the trip itinerary for tourist groups," Information Technology & Tourism, Springer, vol. 0, pages 1-40.
- Abdmouleh, Zeineb & Gastli, Adel & Ben-Brahim, Lazhar & Haouari, Mohamed & Al-Emadi, Nasser Ahmed, 2017. "Review of optimization techniques applied for the integration of distributed generation from renewable energy sources," Renewable Energy, Elsevier, vol. 113(C), pages 266-280.
- Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
More about this item
Keywords
pedestrian behavior; microsimulation model; neural network; crossing; roundabout;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jsusta:v:12:y:2020:i:13:p:5355-:d:379535. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.