November 2023 - Ewgla

First announcement of the TSL 2024 workshop, Nantes (France) 25-27 september 2024
by Olivier Péton 15 Nov '23

15 Nov '23

Dear locators, Here is the first annoucnement for the next TSL workshop in Nantes. Contributions on facility locations under uncertainty are more than welcome. Olivier Péton --------------------- The LS2N Laboratory, IMT Atlantique and CRC Services, with the support of the National Research Agency (ANR), are pleased to announce the call for the *12th INFORMS Transportation Science and Logistics Society Workshop (TSL 2024). * The workshop will be held in Nantes, France, from *September 25 to 27*. The main theme of the workshop is: *Optimizing Transportation and Logistics under Uncertainty * In the ever evolving world of transportation and logistics, there is a growing need to optimize operations under uncertainty. Decision makers are faced with variable transit times, volatile demand volumes, and fluctuating resource availability. This increases their need for algorithms that can deal with uncertainty. We invite submissions that enrich the scientific literature on optimizing transportation and logistics systems in uncertain environments. This includes, but is not limited to contributions in the following areas: - stochastic optimization, - robust optimization, - simulation-based optimization - dynamic models, - time-dependent models, - data-driven optimization, - uncertainty modeling. INSTRUCTIONS FOR CONTRIBUTORS Researchers interested in giving a presentation are invited to submit an abstract of no more than two pages. The submission portal will open before February 2024. Acceptance of a presentation will be based on both the quality of the research and its appropriateness to the theme of the workshop. Please note that the TSL Workshop will be preceded by a *Doctoral School *on the same topic. We will offer a special registration rate for PhD students and young researchers who attend both events. WEBSITE (under construction): https://tsl2024.sciencesconf.org/ IMPORTANT DATES: Abstract submission deadline: /March, 31, 2024 /Notification of acceptance:/ May, 31, 2024 /Early bird registration: / July 11, 2024 /Doctoral school : / September 22-24, 2024 (dates to be confirmed) /TSL Workshop: / September 25-27, 2024 /

1 0

Re: [RO] VeRoLog Doctoral Dissertation Prize
by Fabien Lehuédé 13 Nov '23

13 Nov '23

Dear colleagues, I wanted to share this information from the last VeRoLog newsletter: ---------------------------------------------------------------------------------------------------------------------------------------------- VeRoLog 2024 Conference and VeRoLog Doctoral Disseration Prize – canceled ---------------------------------------------------------------------------------------------------------------------------------------------- Dear community, Due to the difficult situation in Israel, we are sorry to announce the cancellation of the 2024 VeRoLog conference planned to take place in Tel Aviv. This decision was made jointly by the organizing committee and the VeRoLog Board. It was decided that VeRoLog will not hold a conference in 2024. We hope to hold the VeRoLog conference in Tel Aviv in the future. As a consequence, the VeRoLog doctoral dissertation prize will not be awarded this year as planned, but eligible candidates will have the chance to apply for the prize at the next VeRoLog conference. In the past few years, since the COVID crisis began, the VeRoLog meetings were not as frequent as in the past, but the board is determined to revive the community's activity. The organizing committee of the 2024 VeRoLog meeting and VeRoLog board Le 27/09/2023 à 08:45, Fabien Lehuédé (via gdrro Mailing List) a écrit : > Dear colleagues, > > The EURO working group on Vehicle Routing and Logistics optimization > is organizing its 2024 doctoral dissertation prize. > > The prize is open to PhD theses in operations research for > transportation and logistics that were defended between January 1, > 2022 and June 30, 2023. > > The deadline for applying is on November 15,2023. Please find all > application details in the attached file. > > Best regards, > > The VeRoLog DDP 2024 jury > > ---- > > Ce mail a été diffusé par l'intermédiaire de la Liste RO du GDR RO > http://gdrro.lip6.fr -- Fabien LEHUÉDÉ Professeur, groupe Optimisation et Aide à la Décision, DAPI, IMT Atlantique Equipe modelis, Laboratoire des Sciences du Numérique de Nantes (LS2N) 02 51 85 83 21 La Chantrerie 4 rue Alfred Kastler BP 20722 44307 Nantes Cedex 3

1 0

Location related references November 2023
by Frank Plastria 09 Nov '23

09 Nov '23

Hi EWGLA Here's my November entry. Enjoy Frank [1] Fabricio Alves Oliveira, Elisangela Martins de Sá, Sérgio Ricardo de Souza, and Marcone Jamilson Freitas Souza. ILS-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation. Computers & Operations Research, 157:106252, sep 2023. [ DOI<http://dx.doi.org/10.1016/j.cor.2023.106252> ] [2] Akram Al-Hourani, Sithamparanathan Kandeepan, and Simon Lardner. Optimal LAP altitude for maximum coverage. IEEE Wireless Communications Letters, 3(6):569--572, dec 2014. [ DOI<http://dx.doi.org/10.1109/lwc.2014.2342736> ] [3] Hosein Arman, Abdollah Hadi-Vencheh, Amir-Mohammad Golmohammadi, Sanaz Dehghani, and Mohammad H. Nadimi-Shahraki. Optimal locating by integrating volumetric fuzzy sets and geographic coordinate system: An application to healthcare. Computers & Operations Research, 161:106377, jan 2024. [ DOI<http://dx.doi.org/10.1016/j.cor.2023.106377> ] [4] Sonu Bai, Prashanta Majee, and Sahadeo Padhye. On some novel methods for solving the generalized Fermat-Torricelli problem in hilbert spaces. Results in Mathematics, 79(1), oct 2023. [ DOI<http://dx.doi.org/10.1007/s00025-023-02034-x> ] [5] Hannah Bakker and Stefan Nickel. The value of the multi-period solution revisited: When to model time in capacitated location problems. Computers & Operations Research, 161:106428, jan 2024. [ DOI<http://dx.doi.org/10.1016/j.cor.2023.106428> ] [6] Maria Elena Bruni, Sara Khodaparasti, and Guido Perboli. The drone latency location routing problem under uncertainty. Transportation Research Part C: Emerging Technologies, 156:104322, nov 2023. [ DOI<http://dx.doi.org/10.1016/j.trc.2023.104322> ] [7] Xavier Cabezas and Sergio García. A semi-Lagrangian relaxation heuristic algorithm for the simple plant location problem with order. Journal of the Operational Research Society, 74(11):2391--2402, dec 2022. [ DOI<http://dx.doi.org/10.1080/01605682.2022.2150573> ] [8] Hatice Çalik, Tony Wauters, and Greet Vanden Berghe. The exam location problem: Mathematical formulations and variants. Computers & Operations Research, 161:106438, jan 2024. [ DOI<http://dx.doi.org/10.1016/j.cor.2023.106438> ] [9] Francesco Carrabs, Raffaele Cerulli, Federica Laureana, Domenico Serra, and Carmine Sorgente. A genetic approach for the 2-edge-connected minimum branch vertices problem. Networks, 82(4):301--317, feb 2023. [ DOI<http://dx.doi.org/10.1002/net.22142> ] [10] Kuo-Hao Chang, Yi-Chieh Chiang, and Tzu-Yin Chang. Simultaneous location and vehicle fleet sizing of relief goods distribution centers and vehicle routing for post-disaster logistics. Computers & Operations Research, 161:106404, jan 2024. [ DOI<http://dx.doi.org/10.1016/j.cor.2023.106404> ] [11] Dietmar Cleslik. The Fermat-Steiner-Weber-problem in Minkowski spaces. Optimization, 19(4):485--489, jan 1988. [ DOI<http://dx.doi.org/10.1080/02331938808843367> ] [12] Bencomo Domínguez-Martín, Hipólito Hernández-Pérez, Jorge Riera-Ledesma, and Inmaculada Rodríguez-Martín. A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem. Computers & Operations Research, 161:106426, jan 2024. [ DOI<http://dx.doi.org/10.1016/j.cor.2023.106426> ] [13] S. Esmaeilnejad, L. Kattan, and S.C. Wirasinghe. Optimal charging station locations and durations for a transit route with battery-electric buses: A two-stage stochastic programming approach with consideration of weather conditions. Transportation Research Part C: Emerging Technologies, 156:104327, nov 2023. [ DOI<http://dx.doi.org/10.1016/j.trc.2023.104327> ] [14] Emily Fox, Hongyao Huang, and Benjamin Raichel. Clustering with faulty centers. Computational Geometry, 117:102052, feb 2024. [ DOI<http://dx.doi.org/10.1016/j.comgeo.2023.102052> ] [15] Nadine Friesen, Tim Sander, Christina Büsing, Karl Nachtigall, and Nils Nießen. The complexity of the timetable-based railway network design problem. Networks, oct 2023. [ DOI<http://dx.doi.org/10.1002/net.22192> ] [16] Juan-Carlos García-Vélez, Diego Ruiz-Hernández, José-Fernando Camacho-Vallejo, and Juan A. Díaz. Competitive network restructuring with spatially loyal customers. a bilevel facility delocation problem. Computers & Operations Research, 161:106418, jan 2024. [ DOI<http://dx.doi.org/10.1016/j.cor.2023.106418> ] [17] Amirhosein Hajihoseini Gazestani, Seyed Ali Ghorashi, Zhaohui Yang, and Mohammad Shikh-Bahaei. Joint optimization of power and location in full-duplex UAV enabled systems. IEEE Systems Journal, 16(1):914--921, mar 2022. [ DOI<http://dx.doi.org/10.1109/jsyst.2020.3036275> ] [18] Muhammad Salman Habib and Biswajit Sarkar. An integrated location-allocation model for temporary disaster debris management under an uncertain environment. Sustainability, 9(5):716, apr 2017. [ DOI<http://dx.doi.org/10.3390/su9050716> ] [19] Maryam Haghi, Okan Arslan, and Gilbert Laporte. A location-or-routing problem with partial and decaying coverage. Computers & Operations Research, 149:106041, jan 2023. [ DOI<http://dx.doi.org/10.1016/j.cor.2022.106041> ] [20] Jamil Hallak, Melik Koyuncu, and Pinar Miç. Determining shelter locations in conflict areas by multiobjective modeling: A case study in northern Syria. International Journal of Disaster Risk Reduction, 38:101202, aug 2019. [ DOI<http://dx.doi.org/10.1016/j.ijdrr.2019.101202> ] [21] Lu Han, Dachuan Xu, Yicheng Xu, and Ping Yang. Approximation algorithms for the individually fair k-center with outliers. Journal of Global Optimization, 87(2-4):603--618, jun 2022. [ DOI<http://dx.doi.org/10.1007/s10898-022-01195-3> ] [22] Mehran Hasanzadeh, Behrooz Alizadeh, and Fahimeh Baroughi. Optimal algorithms for some inverse uncapacitated facility location problems on networks. Optimization Methods and Software, 37(3):982--1005, feb 2021. [ DOI<http://dx.doi.org/10.1080/10556788.2021.1880578> ] [23] Saeed Tasouji Hassanpour, Ginger Y. Ke, Jiahong Zhao, and David M. Tulett. Infectious waste management during a pandemic: A stochastic location-routing problem with chance-constrained time windows. Computers & Industrial Engineering, 177:109066, mar 2023. [ DOI<http://dx.doi.org/10.1016/j.cie.2023.109066> ] [24] Xiaozhou He and Qingyi Wang. A location-routing model for free-floating shared bike collection considering manual gathering and truck transportation. Socio-Economic Planning Sciences, 88:101667, aug 2023. [ DOI<http://dx.doi.org/10.1016/j.seps.2023.101667> ] [25] Oscar F. Carrasco Heine, Antonia Demleitner, and Jannik Matuschke. Bifactor approximation for location routing with vehicle and facility capacities. European Journal of Operational Research, 304(2):429--442, jan 2023. [ DOI<http://dx.doi.org/10.1016/j.ejor.2022.04.028> ] [26] Christoph Herpfer, Aksel Mjøs, and Cornelius Schmidt. The causal impact of distance on bank lending. Management Science, 69(2):723--740, feb 2023. [ DOI<http://dx.doi.org/10.1287/mnsc.2022.4346> ] [27] Yolanda Hinojosa, Alfredo Marín, and Justo Puerto. Dynamically second-preferred p-center problem. European Journal of Operational Research, 307(1):33--47, may 2023. [ DOI<http://dx.doi.org/10.1016/j.ejor.2022.09.019> ] [28] Sagarkumar Hirpara, Pratik J. Parikh, and Nan Kong. Nested trauma network design considering equity and effectiveness in patient safety. Computers & Industrial Engineering, 181:109250, jul 2023. [ DOI<http://dx.doi.org/10.1016/j.cie.2023.109250> ] [29] Seyyed-Mahdi Hosseini-Motlagh, Mohammad Reza Ghatreh Samani, and Behnam Karimi. Resilient and social health service network design to reduce the effect of COVID-19 outbreak. Annals of Operations Research, 328(1):903--975, may 2023. [ DOI<http://dx.doi.org/10.1007/s10479-023-05363-w> ] [30] Sen Huang, Kanglin Liu, and Zhi-Hai Zhang. Column-and-constraint-generation-based approach to a robust reverse logistic network design for bike sharing. Transportation Research Part B: Methodological, 173:90--118, jul 2023. [ DOI<http://dx.doi.org/10.1016/j.trb.2023.04.010> ] [31] El Mehdi Ibnoulouafi, Mustapha Oudani, Tarik Aouam, and Mounir Ghogho. The p-hub centre routing problem with emissions budget: Formulation and solution procedure. Computers & Operations Research, 154:106211, jun 2023. [ DOI<http://dx.doi.org/10.1016/j.cor.2023.106211> ] [32] Shiva Ilkhanizadeh, Mahmoud Golabi, Siamand Hesami, and Husam Rjoub. The potential use of drones for tourism in crises: A facility location analysis perspective. Journal of Risk and Financial Management, 13(10):246, oct 2020. [ DOI<http://dx.doi.org/10.3390/jrfm13100246> ] [33] Mahdi Imanparast and Seyed Naser Hashemi. A simple greedy approximation algorithm for the unit disk cover problem. AUT Journal of Mathematics and Computing, 2018. [ DOI<http://dx.doi.org/10.22060/ajmc.2018.3044> ] [34] Chandra Ade Irawan, Stefano Starita, Hing Kai Chan, Majid Eskandarpour, and Mohammad Reihaneh. Routing in offshore wind farms: A multi-period location and maintenance problem with joint use of a service operation vessel and a safe transfer boat. European Journal of Operational Research, 307(1):328--350, may 2023. [ DOI<http://dx.doi.org/10.1016/j.ejor.2022.07.051> ] [35] Cem Iyigun and Adi Ben-Israel. A generalized Weiszfeld method for the multi-facility location problem. Operations Research Letters, 38(3):207--214, may 2010. [ DOI<http://dx.doi.org/10.1016/j.orl.2009.11.005> ] [36] Hamed Jahani, Babak Abbasi, Jiuh-Biing Sheu, and Walid Klibi. Supply chain network design with financial considerations: A comprehensive review. European Journal of Operational Research, 312(3):799--839, feb 2024. [ DOI<http://dx.doi.org/10.1016/j.ejor.2023.02.033> ] [37] Marc Janschekowitz, Gita Taherkhani, Sibel A. Alumur, and Stefan Nickel. An alternative approach to address uncertainty in hub location. OR Spectrum, 45(2):359--393, jan 2023. [ DOI<http://dx.doi.org/10.1007/s00291-023-00706-2> ] [38] Mohsin Nasir Jat. Optimizing area coverage for time-differentiated distribution: A unidimensional analysis. Transportation Journal, 57(1):83--111, jan 2018. [ DOI<http://dx.doi.org/10.5325/transportationj.57.1.0083> ] [39] Sachin Jayaswal and Navneet Vidyarthi. Multiple allocation hub location with service level constraints for two shipment classes. European Journal of Operational Research, 309(2):634--655, sep 2023. [ DOI<http://dx.doi.org/10.1016/j.ejor.2023.01.066> ] [40] Zhuoxuan Jiang, Xinyuan Zhao, and Chao Ding. A proximal DC approach for quadratic assignment problem. Computational Optimization and Applications, 78(3):825--851, jan 2021. [ DOI<http://dx.doi.org/10.1007/s10589-020-00252-5> ] [41] Christopher Jung, Sampath Kannan, and Neil Lutz. Service in Your Neighborhood: Fairness in Center Location. In Aaron Roth, editor, 1st Symposium on Foundations of Responsible Computing (FORC 2020), volume 156 of Leibniz International Proceedings in Informatics (LIPIcs), pages 5:1--5:15, Dagstuhl, Germany, 2020. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. [ DOI<http://dx.doi.org/10.4230/LIPIcs.FORC.2020.5> | http<https://drops.dagstuhl.de/opus/volltexte/2020/12021> ] Prof. Em. Frank Plastria BUTO, Vrije Universiteit Brussel frank.plastria(a)vub.be

1 0

Support for local and topic-specific meetings to promote location science (second call)
by Diego Ponce 03 Nov '23

03 Nov '23

Dear Locators, this is the second call of the year (first call was in February) for the initiative to support and encourage local or topic-specific location meetings. If you wish to organize a scientific meeting or workshop around a specific topic such as competitive location, emergency facility location, stochastic location etc. or a meeting covering a broader range of location topics in your institution, you will be able to request support from EWGLA up to a maximum of EUR1,000. The meeting should be open to the entire location community, and it must be announced via the EWGLA mailing list and the web site of the organized meeting (upon approval of the support). The procedure for applications and decisions for support is planned as follows: Applicants need to submit a brief letter of intention (about one page) to organize a meeting within the next 12 months. The applications will be evaluated within two weeks after the deadline and the amount of support will be communicated to the applicants. The letter of intention should provide the following details: 1. A brief description of the meeting, including sufficient information about the format (workshop, conference etc.), the organizers, and the target audience. 2. The topic and how it relates to Location Science. 3. A brief motivation on how this meeting will contribute to the advancement of Location Science or how the (local or international) location community will benefit from it. 4. A concrete explanation and reasoning for the kind of support that is asked for from EWGLA (travel expenses for invited external speakers, supporting student participation, etc.). 5. The budget requested from EWGLA and a plan of the estimated budget for the entire meeting. Note that all expenses will have to be justified with receipts and proofs of payment. 6. Mention of other potential supports from local/international societies, organizations (government, NGO), universities or industry. The deadline for the second call of this year is 15 January 2024. Depending on the number of applications received by the deadline, it will be possible to provide partial or full support (up to a maximum of EUR1,000) after evaluation. All the best, Hatice Çalık, Carmela Piccolo, Diego Ponce EWGLA Coordination Board www.us.es [1] Por favor considere el medio ambiente antes de imprimir este correo electrónico. - Este correo electrónico y, en su caso, cualquier fichero anexo al mismo, contiene información de carácter confidencial exclusivamente dirigida a su destinatario o destinatarios. Si no es Vd. el destinatario del mensaje, le ruego lo destruya sin hacer copia digital o física, comunicando al emisor por esta misma vía la recepción del presente mensaje. Gracias Links: ------ [1] http://www.us.es/

1 0