FADE: Towards Flexible and Adaptive Distance Estimation Considering Obstacles: Vision Paper
Pages 1 - 5
Abstract
In the last decades, especially intensified by the pandemic situation in which many people stay at home and order goods online, the need for efficient logistics systems has increased significantly. Hence, the performance of optimization techniques for logistic processes are becoming more and more important. These techniques often require estimates about distances to customers and facilities where operators have to choose between exact results or short computation times. In this vision paper, we propose an approach for Flexible and Adaptive Distance Estimation (FADE). The central idea is to abstract map knowledge into a less complex graph to trade off between computation time and result accuracy. We propose to further apply concepts from self-aware computing in order to support the dynamic adaptation to individual goals.
References
[1]
2021. E-commerce in the time of COVID-19. https://www.oecd.org/coronavirus/ policy-responses/e-commerce-in-the-time-of-covid-19--3a2b78e8. [Online; accessed 12. Jan. 2022].
[2]
2022. How e-commerce share of retail soared across the globe: A look at eight countries. https://www.mckinsey.com/featured-insights/coronavirus-leadingthrough-the-crisis/charting-the-path-to-the-next-normal/how-e-commerceshare-of-retail-soared-across-the-globe-a-look-at-eight-countries. [Online; accessed 12. Jan. 2022].
[3]
M. Hakan Akyüz. 2018. Discretization Based Heuristics for the Capacitated Multi-Facility Weber Problem with Convex Polyhedral Barriers. An International Journal of Optimization and Control: Theories & Applications (IJOCTA) 8, 1 (2018), 26--42. https://doi.org/10.11121/ijocta.01.2018.00388
[4]
Ethem Alpaydin. Kuban Altinel, and Necati Aras. 1996. Parametric Distance Functions vs. Nonparametric Neural Networks for Estimating Road Travel Distances. European Journal of Operational Research 93, 2 (Sept. 1996), 230--243. https://doi.org/10.1016/0377--2217(96)00045--8
[5]
Luciano Blasi, Egidio D'Amato, Massimiliano Mattei, and Immacolata Notaro. 2020. Path Planning and Real-Time Collision Avoidance Based on the Essential Visibility Graph. Applied Sciences 10, 16 (Jan. 2020), 5613. https://doi.org/10. 3390/app10165613
[6]
Jack Brimberg, John H. Walker, and Robert F. Love. 2007. Estimation of Travel Distances with the Weighted p Norm: Some Empirical Results. Journal of Transport Geography 15, 1 (Jan. 2007), 62--72. https://doi.org/10.1016/j.jtrangeo. 2006.01.004
[7]
Derya Celik Turkoglu and Mujde Erol Genevois. 2020. A comparative survey of service facility location problems. Annals of Operations Research 292, 1 (2020), 399--468. https://doi.org/10.1007/s10479-019-03385-x
[8]
Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. 2009. Introduction to algorithms. MIT press.
[9]
Kalyanmoy Deb, Amrit Pratap, Sameer Agarwal, and TAMT Meyarivan. 2002. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6, 2 (2002), 182--197. https://doi.org/10.1109/4235. 996017
[10]
Marco Dorigo, Vittorio Maniezzo, and Alberto Colorni. 1996. Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics, Part B 26, 1 (1996), 29--41. https://doi.org/10.1109/3477.484436
[11]
Robert Geisberger, Peter Sanders, Dominik Schultes, and Daniel Delling. 2008. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In Experimental Algorithms, Catherine C. McGeoch (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 319--333.
[12]
Peter Hart, Nils Nilsson, and Bertram Raphael. 1968. A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics 4, 2 (1968), 100--107. https://doi.org/10.1109/tssc.1968. 300136
[13]
Kazuyoshi Hidaka and Hiroyuki Okano. 2003. An approximation algorithm for a large-scale facility location problem. Algorithmica 35, 3 (2003), 216--224. https://doi.org/10.1007/s00453-002-0996-z
[14]
John H. Holland. 1992. Genetic Algorithms. Scientific American 267, 1 (1992), 66--73.
[15]
J. Kennedy and R. Eberhart. 1995. Particle swarm optimization. In Proceedings of ICNN'95 - International Conference on Neural Networks, Vol. 4. 1942--1948 vol.4. https://doi.org/10.1109/ICNN.1995.488968
[16]
Martin Kords. 2021. Transportleistung im Straßengüterverkehr 2019 | Statista. https://de.statista.com/statistik/daten/studie/2979/umfrage/entwicklung-dertransportleistung-des-strassengueterverkehrs. [Online; acc. 3. Feb. 2021].
[17]
Samuel Kounev, Peter Lewis, Kirstie L Bellman, Nelly Bencomo, Javier Camara, Ada Diaconescu, Lukas Esterle, Kurt Geihs, Holger Giese, Sebastian Götz, et al. 2017. The Notion of Self-aware Computing. In Self-Aware Computing Systems. Springer, 3--16.
[18]
Amgad Madkour, Walid G. Aref, Faizan Ur Rehman, Mohamed Abdur Rahman, and Saleh Basalamah. 2017. A Survey of Shortest-Path Algorithms. arXiv:1705.02044 [cs.DS]
[19]
Ricardo Mesquita and Pedro D Gaspar. 2020. A Path Planning Optimization Algorithm Based on Particle Swarm Optimization for UAVs for Bird Monitoring and Repelling--Simulation Results. In 2020 International Conference on Decision Aid Sciences and Application (DASA). IEEE, 1144--1148.
[20]
Mohammad Mahdi Nasiri, Vahid Mahmoodian, Ali Rahbari, and Shabnam Farahmand. 2018. A modified genetic algorithm for the capacitated competitive facility location problem with the partial demand satisfaction. Computers & Industrial Engineering 124 (2018), 435--448.
[21]
Ryan A. Rossi and Nesreen K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In AAAI. https: //networkrepository.com
[22]
Rizwan Shahid, Stefania Bertazzon, Merril L. Knudtson, and William A. Ghali. 2009. Comparison of Distance Measures in Spatial Analytical Modeling for Health Service Planning. BMC Health Services Research 9, 1 (Nov. 2009), 200. https://doi.org/10.1186/1472--6963--9--200
[23]
Vedat Verter. 2011. Uncapacitated and Capacitated Facility Location Problems. In Foundations of Location Analysis, H. A. Eiselt and Vladimir Marianov (Eds.). Springer US, New York, NY, 25--37. https://doi.org/10.1007/978--1--4419--7572-0_2
[24]
Cristian Zambrano-Vega, Génesis Acosta, Jasmin Loor, Byron Suárez, Carla Jaramillo, and Byron Oviedo. 2019. A Sales Route Optimization Mobile Application Applying a Genetic Algorithm and the Google Maps Navigation System. In International Conference on Information Technology & Systems. Springer, 517--527.
Index Terms
- FADE: Towards Flexible and Adaptive Distance Estimation Considering Obstacles: Vision Paper
Recommendations
Estimating distances via received signal strength and connectivity in wireless sensor networks
AbstractDistance estimation is vital for localization and many other applications in wireless sensor networks (WSNs). Particularly, it is desirable to implement distance estimation as well as localization without using specific hardware in low-cost WSNs. ...
Competing in Product and Service: A Product Life-Cycle Model
In this paper we develop a product life-cycle model that studies a set of strategic choices facing manufacturers as they design the joint product/service bundle for a product which may require maintenance and repair support after its sale. The choice ...
FADE: Fast and Asymptotically Efficient Distributed Estimator for Dynamic Networks
Consider a set of agents that wish to estimate a vector of parameters. For this estimation goal, each agent can measure (in additive Gaussian noise) linear combinations of the unknown vector of parameters and can broadcast information to a few other ...
Comments
Information & Contributors
Information
Published In
July 2022
166 pages
ISBN:9781450391597
DOI:10.1145/3491204
- General Chairs:
- Dan Feng,
- Steffen Becker,
- Program Chairs:
- Nikolas Herbst,
- Philipp Leitner
Copyright © 2022 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 19 July 2022
Check for updates
Author Tags
Qualifiers
- Short-paper
Funding Sources
- Bayerisches Verbundforschungsprogramm (BayVFP) ? Digitalisierung
Conference
ICPE '22
Sponsor:
ICPE '22: ACM/SPEC International Conference on Performance Engineering
April 9 - 13, 2022
Bejing, China
Acceptance Rates
ICPE '22 Paper Acceptance Rate 14 of 58 submissions, 24%;
Overall Acceptance Rate 252 of 851 submissions, 30%
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 69Total Downloads
- Downloads (Last 12 months)5
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in