Ewgla

ewgla@mail.euro-online.org

2 participants
317 discussions

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

Fw: 2024 A.W. Tucker Prize announcement
by Hatice ÇALIK 23 Oct '23

23 Oct '23

Dear Locators, Please find below the call for nominations for the 2024 A. W. Tucker Prize. All the best, Hatice ________________________________ From: Sarah Fores <manager(a)euro-online.org> -------------- Dear Colleagues, The Mathematical Optimization Society invites nominations for the 2024 A.W. Tucker Prize to be awarded at the International Symposium on Mathematical Programming (ISMP) in Montreal, Canada (July 21 - 26, 2024). The prize is awarded to an outstanding doctoral dissertation defended (and degree awarded) between January 1, 2021 and January 1, 2024. The deadline for nominations is January 15, 2024. The nominator must be a faculty member at the institution that awarded the nominee's doctoral degree or a member of the nominee's dissertation committee. Applications should consist of the following four files, each of which should be submitted as a single, separate PDF file: - a letter of nomination, - the nominee's dissertation, - a summary of the dissertation's contributions, written by the nominee, that is no more than five (5) pages in length, and - a brief biographical sketch of the nominee. Nominations and the accompanying documentation must be written in English. The nomination should be emailed to Frank E. Curtis, frank.e.curtis(a)lehigh.edu<mailto:frank.e.curtis@lehigh.edu> The call for nominations is also announced on the MOS website: http://www.mathopt.org/?nav=tucker_call Nominations will be evaluated by the 2024 A.W. Tucker Prize Committee with at most three finalists chosen for the prize. The finalists will be invited to give oral presentations of their work at a special session of ISMP 2024. The winner will be announced during the symposium. More details about the prize can be found on the MOS website: http://www.mathopt.org/?nav=tucker Best, Francesca Maggioni on behalf of the 2024 A.W. Tucker Prize Committee (Frank E. Curtis, Shipra Agrawal, Afonso Bandeira, Francesca Maggioni, and Laura Sanita) -- Dr Sarah Fores, FORS Manager of EURO [https://ci3.googleusercontent.com/mail-sig/AIorK4y2u_dumVHYLyd4TA_Hfc6_BXMw…]<https://euro2024cph.dk/>

1 0

Special issue on location analysis in Networks and Spatial Economics
by Joerg Kalcsics 23 Oct '23

23 Oct '23

Dear Locators, Please see Zvi's email below about a special issue on location science. Best wishes, Joerg. From: Drezner, Zvi <zdrezner(a)fullerton.edu> Sent: Montag, 23. Oktober 2023 01:25 To: Joerg Kalcsics <Joerg.Kalcsics(a)ed.ac.uk> Subject: Special Issue [..] Dear Colleagues, I was invited to edit a special issue on location analysis by the Networks and Spatial Economics Journal. I inquire if you, and you can ask your colleagues, have a paper in a few months that you would like to submit to such a special issue. The papers will, of course, be refereed by location researchers. Please indicate your intention and a rough estimate of the time the paper will be ready. Once I get sufficient intentions to submit, and expected submission times, I will set up a deadline for submission. Hope all is well, Zvi zdrezner(a)fullerton.edu<mailto:zdrezner@fullerton.edu> ----------------- Zvi Drezner Professor Emeritus, Department of ISDS College of Business and Economics California State University-Fullerton Fullerton, CA 92834. Tel: (657) 278-2712 Fax: (657) 278-5940 Web page: https://business.fullerton.edu/faculty/zvi-drezner/<%20https:/business.fullerton.edu/faculty/zvi-drezner/> The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. Is e buidheann carthannais a th' ann an Oilthigh Dh?n ?ideann, cl?raichte an Alba, ?ireamh cl?raidh SC005336.

1 0

EURO 2024 - CALL FOR ABSTRACTS
by carmela.piccolo 22 Oct '23

22 Oct '23

Dear EWGLA members, we remind you that the 33rd edition of the EURO conference will take place in Copenhagen (Denmark) from 30th June to 3rd July 2024 at the Technical University of Denmark. More info is available at the following link: https://euro2024cph.dk/ The abstract submission is already open, and the deadline is the 3rd of March, 2024. If you plan to attend the conference, we strongly encourage participation in the stream devoted to ‘Location Analysis’. In order to join the stream, you need to submit the abstract through EURO online and select the code b653a54d. We hope to have a good representation of our WG in the meeting. We are looking forward to seeing you. Carmela Piccolo Hatice Calik Diego Ponce

1 0

FW: EURO Support for NATCOR Bursaries
by Joerg Kalcsics 18 Oct '23

18 Oct '23

Dear Locators, please see the announcement below. Please also distribute to your PhD students. Cheers, Joerg. From: Operational Research community <ORNET(a)JISCMAIL.AC.UK> On Behalf Of Sarah Fores Sent: Dienstag, 17. Oktober 2023 17:52 To: ORNET(a)JISCMAIL.AC.UK Subject: EURO Support for NATCOR Bursaries EURO Support for NATCOR Bursaries https://www.euro-online.org/web/pages/1568/natcor-bursaries NATCOR (https://www.natcor.ac.uk/), a National Taught Course Centre in Operational Research, delivers taught courses to PhD students, from across Europe, on a number of different topics in OR. EURO is advertising a competition for bursaries for courses run in 2024. The NATCOR course fees and on-site accommodation (if applicable) will be funded by EURO for successful candidates. Typically, accommodation for any residential courses will be four nights bed and breakfast. If additional or alternative accommodation is required, candidates will need to arrange and pay for this. Also any extra costs incurred will need to be settled personally. Please also be reminded that successful candidates requiring visas will need to apply for these in good time. Eligibility Applicants must be PhD students, from one of the EURO member countries or studying in one of the EURO member countries(see https://www.euro-online.org/web/pages/1457/current-member-societies). Applicants must have good English Language skills as all NATCOR courses will be in English. Preference will be given to students in their first or second years but all are welcome to apply. Preference will also be given to applicants who have not previously received support from EURO for NATCOR or other PhD schools. Application To apply for a bursary, candidates from a EURO member society country, or studying in a EURO member society country, should submit a zip file containing the application form (available at https://www.euro-online.org/web/pages/1540/euro-phd-schools-eps), their curriculum vitae (including their academic track record), a letter outlining their motivation to attend, and a letter of recommendation from their supervisor. Applicants should declare on their application if they are receiving any additional support from their PhD funding body or other sponsor. Selection Process The EURO VP2 selects and ranks (in the case of more than one accepted from the same country) the candidates. When accepting the candidates the VP2 should aim at a good distribution of the participants among the EURO member societies. Current Call - Important Dates Submit documents (see above) to https://www.euro-online.org/awards/natcor2024/registration.php Deadline for applications: December 21, 2023 Notification of acceptance: February 9, 2024 -- Dr Sarah Fores, FORS Manager of EURO ________________________________ To unsubscribe from the ORNET list, click the following link: https://www.jiscmail.ac.uk/cgi-bin/WA-JISC.exe?SUBED1=ORNET&A=1 The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. Is e buidheann carthannais a th’ ann an Oilthigh Dhùn Èideann, clàraichte an Alba, àireamh clàraidh SC005336.

1 0

Location related references October 2023
by Frank Plastria 11 Oct '23

11 Oct '23

Dear ewgla member, Here's the new list collected in the last month. A mix of very recent ones and several somewhat older. Enjoy, Frank Plastria Prof. Em. Frank Plastria BUTO, Vrije Universiteit Brussel frank.plastria(a)vub.be [1] Bernardetta Addis, Giuliana Carello, and Meihui Gao. On a virtual network functions placement and routing problem: Some properties and a comparison of two formulations. Networks, 75(2):158--182, nov 2019. [ DOI<http://dx.doi.org/10.1002/net.21915> ] [2] Olawale J. Adeleke and David O. Olukanni. Facility location problems: Models, techniques, and applications in waste management. Recycling, 5(2):10, may 2020. [ DOI<http://dx.doi.org/10.3390/recycling5020010> ] [3] Amin Aghalari, Darweesh Ehssan Salamah, Carlos Marino, and Mohammad Marufuzzaman. Electric vehicles fast charger location-routing problem under ambient temperature. Annals of Operations Research, 324(1-2):721--759, oct 2021. [ DOI<http://dx.doi.org/10.1007/s10479-021-04375-8> ] [4] Abdullah Zareh Andaryan, Kasra Mousighichi, and Nader Ghaffarinasab. A heuristic approach to the stochastic capacitated single allocation hub location problem with bernoulli demands. European Journal of Operational Research, 312(3):954--968, feb 2024. [ DOI<http://dx.doi.org/10.1016/j.ejor.2023.07.015> ] [5] Tetsuya Araki and Shin ichi Nakano. Max-min dispersion on a line. Journal of Combinatorial Optimization, 44(3):1824--1830, feb 2020. [ DOI<http://dx.doi.org/10.1007/s10878-020-00549-5> ] [6] Anuj Bajaj, Boris S. Mordukhovich, Nguyen Mau Nam, and Tuyen Tran. Solving a continuous multifacility location problem by DC algorithms. Optimization Methods and Software, 37(1):338--360, may 2020. [ DOI<http://dx.doi.org/10.1080/10556788.2020.1771335> ] [7] Hannah Bakker, Florian Diehlmann, Marcus Wiens, Stefan Nickel, and Frank Schultmann. School or parking lot? selecting locations for points of distribution in urban disasters. Socio-Economic Planning Sciences, 89:101670, oct 2023. [ DOI<http://dx.doi.org/10.1016/j.seps.2023.101670> ] [8] Ayfer Basar, Bülent Çatay, and Tonguç Ünlüyurt. A taxonomy for emergency service station location problem. Optimization Letters, 6(6):1147--1160, aug 2011. [ DOI<http://dx.doi.org/10.1007/s11590-011-0376-1> ] [9] A. Baskar and M. Anthony Xavior. A four-point direction search heuristic algorithm applied to facility location on plane, sphere, and ellipsoid surfaces. Journal of the Operational Research Society, 73(11):2385--2394, oct 2021. [ DOI<http://dx.doi.org/10.1080/01605682.2021.1984185> ] [10] A. Baskar and M. Anthony Xavior. A facility location model for marine applications. Materials Today: Proceedings, 46:8143--8147, 2021. [ DOI<http://dx.doi.org/10.1016/j.matpr.2021.03.107> ] [11] André Berger, Alexander Grigoriev, and Andrej Winokurow. An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions. Computational Optimization and Applications, 68(3):661--669, aug 2017. [ DOI<http://dx.doi.org/10.1007/s10589-017-9935-4> ] [12] Ernesto G. Birgin, John L. Gardenghi, and Antoine Laurain. Bounds on the optimal radius when covering a set with minimum radius identical disks. Mathematics of Operations Research, sep 2023. [ DOI<http://dx.doi.org/10.1287/moor.2022.0104> ] [13] Víctor Blanco. Ordered p-median problems with neighbourhoods. Computational Optimization and Applications, 73(2):603--645, feb 2019. [ DOI<http://dx.doi.org/10.1007/s10589-019-00077-x> ] [14] Johannes Blum. W[1]-hardness of the k-center problem parameterized by the skeleton dimension. Journal of Combinatorial Optimization, 44(4):2762--2781, aug 2021. [ DOI<http://dx.doi.org/10.1007/s10878-021-00792-4> ] [15] Héctor J. Carlo, Francisco Aldarondo, Priscilla M. Saavedra, and Silmarie N. Torres. Capacitated continuous facility location problem with unknown number of facilities. Engineering Management Journal, 24(3):24--31, sep 2012. [ DOI<http://dx.doi.org/10.1080/10429247.2012.11431944> ] [16] Guido F. M. G. Carvalho, Douglas F. Corrêa, David A. Pelta, Diego C. Knupp, and Antônio J. Silva Neto. Efficient simulation of pollutant dispersion using machine learning. In Lecture Notes in Computer Science, pages 372--383. Springer Nature Switzerland, 2023. [ DOI<http://dx.doi.org/10.1007/978-3-031-40725-3_32> ] [17] Marta Cavaleiro and Farid Alizadeh. A dual simplex-type algorithm for the smallest enclosing ball of balls. Computational Optimization and Applications, 79(3):767--787, may 2021. [ DOI<http://dx.doi.org/10.1007/s10589-021-00283-6> ] [18] Ipek Cebi and Dionysis Goularas. Location analysis for a grocery store based on a multi-objective optimization approach. In 2021 International Conference on Computer, Information and Telecommunication Systems (CITS). IEEE, nov 2021. [ DOI<http://dx.doi.org/10.1109/cits52676.2021.9618238> ] [19] Adelaide Cerveira, Amaro de Sousa, E. J. Solteiro Pires, and José Baptista. Optimizing wind farm cable layout considering ditch sharing. International Transactions in Operational Research, 31(1):88--114, jan 2023. [ DOI<http://dx.doi.org/10.1111/itor.13258> ] [20] Reuven Chen. Noniterative solution of some Fermat-Weber location problems. Advances in Operations Research, 2011:1--10, 2011. [ DOI<http://dx.doi.org/10.1155/2011/379505> ] [21] Ta-Cheng Chen, Sheng-Chuan Wang, and Wen-Cheng Tseng. Using a hybrid evolutionary algorithm for solving signal transmission station location and allocation problem with different regional communication quality restriction. International Journal of Engineering and Technology Innovation, 10(3):165--178, jul 2020. [ DOI<http://dx.doi.org/10.46604/ijeti.2020.5054> ] [22] Wei jie Cong, Le Wang, and Hui Sun. Rank-two update algorithm versus frank-wolfe algorithm with away steps for the weighted euclidean one-center problem. Computational Optimization and Applications, 75(1):237--262, nov 2019. [ DOI<http://dx.doi.org/10.1007/s10589-019-00148-z> ] [23] Tobias Crönert, Layla Martin, Stefan Minner, and Christopher S. Tang. Inverse optimization of integer programming games for parameter estimation arising from competitive retail location selection. European Journal of Operational Research, 312(3):938--953, feb 2024. [ DOI<http://dx.doi.org/10.1016/j.ejor.2023.06.041> ] [24] P. Das, N.R. Chakraborti, and P.K. Chaudhuri. Spherical minimax location problem. Computational Optimization and Applications, 18(3):311--326, 2001. [ DOI<http://dx.doi.org/10.1023/a:1011248622793> ] [25] Soumen Kumar Das, Magfura Pervin, Sankar Kumar Roy, and Gerhard Wilhelm Weber. Multi-objective solid transportation-location problem with variable carbon emission in inventory management: a hybrid approach. Annals of Operations Research, 324(1-2):283--309, feb 2021. [ DOI<http://dx.doi.org/10.1007/s10479-020-03809-z> ] [26] Yashoda Devi, Sabyasachi Patra, and Surya Prakash Singh. A location-allocation model for influenza pandemic outbreaks: A case study in india. Operations Management Research, 15(1-2):487--502, sep 2021. [ DOI<http://dx.doi.org/10.1007/s12063-021-00216-w> ] [27] Weiyi Ding and Xiaoxian Tang. Projections of tropical Fermat-Weber points. Mathematics, 9(23):3102, dec 2021. [ DOI<http://dx.doi.org/10.3390/math9233102> ] [28] Nazli Dolu, Umur Hastürk, and Mustafa Kemal Tural. Solution methods for a min-max facility location problem with regional customers considering closest euclidean distances. Computational Optimization and Applications, 75(2):537--560, jan 2020. [ DOI<http://dx.doi.org/10.1007/s10589-019-00163-0> ] [29] Tammy Drezner and Zvi Drezner. A note on equity across groups in facility location. Naval Research Logistics (NRL), pages n/a--n/a, 2011. [ DOI<http://dx.doi.org/10.1002/nav.20476> ] [30] Zvi Drezner, Pawel Kalczynski, and Said Salhi. The planar multiple obnoxious facilities location problem: A voronoi based heuristic. Omega, 87:105--116, sep 2019. [ DOI<http://dx.doi.org/10.1016/j.omega.2018.08.013> ] [31] Tammy Drezner and Zvi Drezner. Asymmetric distance location model. INFOR: Information Systems and Operational Research, 59(1):102--110, jul 2020. [ DOI<http://dx.doi.org/10.1080/03155986.2020.1789386> ] [32] Tammy Drezner, Zvi Drezner, and Dawit Zerom. An extension of the gravity model. Journal of the Operational Research Society, 73(12):2732--2740, dec 2021. [ DOI<http://dx.doi.org/10.1080/01605682.2021.2015256> ] [33] Fatma ERSOY DURAN and Diclehan TEZCANER ÖZTÜRK. Yari-istenen tesis yer seçimi problemi için iki kriterli bir yaklasim (a bicriteria approach for the semi-desirable facility location problem ). Gazi Üniversitesi Mühendislik Mimarlik Fakültesi Dergisi, 39(1):417--430, aug 2023. [ DOI<http://dx.doi.org/10.17341/gazimmfd.1164114> ] [34] Péter Egri, Balázs Dávid, Tamás Kis, and Miklós Krész. Robust facility location in reverse logistics. Annals of Operations Research, 324(1-2):163--188, dec 2021. [ DOI<http://dx.doi.org/10.1007/s10479-021-04405-5> ] [35] Erhan Erkut, Armann Ingolfsson, Thaddeus Sim, and Günes Erdoğan. Computational comparison of five maximal covering models for locating ambulances. Geographical Analysis, 41(1):43--65, jan 2009. [ DOI<http://dx.doi.org/10.1111/j.1538-4632.2009.00747.x> ] [36] Pablo Escalona, Alejandro Angulo, Luce Brotcorne, Bernard Fortz, and Paulina Tapia. Fill-rate service level constrained distribution network design. International Transactions in Operational Research, 31(1):5--28, jun 2023. [ DOI<http://dx.doi.org/10.1111/itor.13331> ] [37] Laureano F. Escudero, María Araceli Garín, Celeste Pizarro, and Aitziber Unzueta. On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems. Computational Optimization and Applications, 70(3):865--888, mar 2018. [ DOI<http://dx.doi.org/10.1007/s10589-018-9995-0> ] [38] Jie Fan, Lean Yu, Xiang Li, Changjing Shang, and Minghu Ha. Reliable location allocation for hazardous materials. Information Sciences, 501:688--707, oct 2019. [ DOI<http://dx.doi.org/10.1016/j.ins.2019.03.006> ] [39] Reza Zanjirani Farahani, Maryam SteadieSeifi, and Nasrin Asgari. Multiple criteria facility location problems: A survey. Applied Mathematical Modelling, 34(7):1689--1709, jul 2010. [ DOI<http://dx.doi.org/10.1016/j.apm.2009.10.005> ] [40] Amir Mohammad Fathollahi Fard and Mostafa Hajaghaei-Keshteli. A tri-level location-allocation model for forward/reverse supply chain. Applied Soft Computing, 62:328--346, jan 2018. [ DOI<http://dx.doi.org/10.1016/j.asoc.2017.11.004> ] [41] José Fernández, Juana L. Redondo, Pilar M. Ortigosa, and Boglárka G.-Tóth. Huff-like stackelberg location problems on the plane. In Springer Optimization and Its Applications, pages 129--169. Springer International Publishing, 2017. [ DOI<http://dx.doi.org/10.1007/978-3-319-52654-6_7> ] [42] Elisabeth Gaar and Markus Sinnl. Exact solution approaches for the discrete p-center problem. Networks, jun 2023. [ DOI<http://dx.doi.org/10.1002/net.22162> ] [43] Xuehong Gao. A location-driven approach for warehouse location problem. Journal of the Operational Research Society, 72(12):2735--2754, oct 2020. [ DOI<http://dx.doi.org/10.1080/01605682.2020.1811790> ] [44] Masoud Atashpaz Gargari and Rashed Sahraeian. An exact criterion space search method for a bi-objective nursing home location and allocation problem. Mathematics and Computers in Simulation, 206:166--180, apr 2023. [ DOI<http://dx.doi.org/10.1016/j.matcom.2022.11.011> ] [45] Nader Ghaffarinasab, Özlem Çavus, and Bahar Y. Kara. A mean-CVaR approach to the risk-averse single allocation hub location problem with flow-dependent economies of scale. Transportation Research Part B: Methodological, 167:32--53, jan 2023. [ DOI<http://dx.doi.org/10.1016/j.trb.2022.11.008> ] [46] Riccardo Giusti, Daniele Manerba, Teodor Gabriel Crainic, and Roberto Tadei. The synchronized multi-commodity multi-service transshipment-hub location problem with cyclic schedules. Computers & Operations Research, 158:106282, oct 2023. [ DOI<http://dx.doi.org/10.1016/j.cor.2023.106282> ] [47] Katharina Glock and Anne Meyer. Spatial coverage in routing and path planning problems. European Journal of Operational Research, 305(1):1--20, feb 2023. [ DOI<http://dx.doi.org/10.1016/j.ejor.2022.02.031> ] [48] Kannan Govindan, Farhad Salehian, Hadi Kian, Seyed Teimoor Hosseini, and Hassan Mina. A location-inventory-routing problem to design a circular closed-loop supply chain network with carbon tax policy for achieving circular economy: An augmented epsilon-constraint approach. International Journal of Production Economics, 257:108771, mar 2023. [ DOI<http://dx.doi.org/10.1016/j.ijpe.2023.108771> ] [49] Luca Greco, Simona Pacillo, and Piera Maresca. An impartial trimming algorithm for robust circle fitting. Computational Statistics & Data Analysis, 181:107686, may 2023. [ DOI<http://dx.doi.org/10.1016/j.csda.2022.107686> ] [50] Yan Gu, Jianlin Jiang, and Shun Zhang. Distributionally robust weber problem with uncertain demand. Computational Optimization and Applications, mar 2023. [ DOI<http://dx.doi.org/10.1007/s10589-023-00470-7> ] [51] Joachim Gudmundsson and Yuan Sha. Algorithms for radius-optimally augmenting trees in a metric space. Computational Geometry, 114:102018, oct 2023. [ DOI<http://dx.doi.org/10.1016/j.comgeo.2023.102018> ] [52] Vasily V. Gusev. Set-weighted games and their application to the cover problem. European Journal of Operational Research, 305(1):438--450, feb 2023. [ DOI<http://dx.doi.org/10.1016/j.ejor.2022.05.026> ]

1 0

[RO] VeRoLog Doctoral Dissertation Prize
by Fabien Lehuédé 06 Oct '23

06 Oct '23

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

1 0

Season 6 of the Online Seminar Series Machine Learning NeEDS Mathematical Optimization
by Hatice ÇALIK 21 Sep '23

21 Sep '23

Dear Locators, The attached announcement for the Online Seminar Series Machine Learning NeEDS Mathematical Optimization may be interesting for many of you. Cheers, Hatice ________________________________ From: EMILIO J CARRIZOSA PRIEGO <ecarrizosa(a)us.es> Sent: 20 September 2023 12:39 To: Hatice ÇALIK; carmela.piccolo(a)unina.it; DIEGO PONCE LOPEZ Cc: Dolores Romero Morales; EMILIO J CARRIZOSA PRIEGO Subject: Season 6 of the Online Seminar Series Machine Learning NeEDS Mathematical Optimization Dear colleagues, We are launching Session 6 of our Online Seminar Series Machine Learning NeEDS Mathematical Optimization. We would kindly ask you to distribute among the members of the EWGLA and those colleagues potentially interested, the announcement below. Thanks a lot for your help! Greetings, Dolores Romero Morales and Emilio Carrizosa %%% Season 6 of the Online Seminar Series Machine Learning NeEDS Mathematical Optimization Dear colleagues, We are happy to announce that on October 2, we are starting Season 6 of the Online Seminar Series Machine Learning NeEDS Mathematical Optimization, https://congreso.us.es/mlneedsmo/. Find below the tentative program. This seminar series is an activity from the EU H2020 MSCA RISE NeEDS project, https://riseneeds.eu/ branding the role of Operations Research in Artificial Intelligence with the support of EURO, https://www.euro-online.org Tentative Program October 2, 2023 Prof Mike Baiocchi, Stanford University, USA Title: Outcome Reasoning: the under-discussed engine powering black box development Link to talk: https://eu.bbcollab.com/collab/ui/session/guest/c8ae1469ed034fddb17cddcde67… October 9, 2023 YOUNG Caroline Spieckermann, Technical University of Munich, Munich, Germany Title: A Graph Neural Network-based Reduce-then-Optimize Heuristic for the Fixed-Charge Transportation Problem Miaolan Xie, Cornell University, USA Title: Reliable Adaptive Stochastic Optimization with High Probability Guarantees Quan Zhou, Imperial College London, UK Title: Frontier Challenges in AI: The case of algorithmic bias in forecasting tools Link to talk: https://eu.bbcollab.com/collab/ui/session/guest/e6d83628f37b4f65adfb6062ee0… October 23, 2023 Prof Daniel Kuhn, EPFL, Switzerland Title: Metrizing Fairness  Link to talk: https://eu.bbcollab.com/collab/ui/session/guest/6e6638bbdd854181b21637e1e8c… October 30, 2023 Prof Yael Grushka-Cockayne, University of Virginia, USA Title: Challenges of Combining Forecasts from Correlated Sources Link to talk: https://eu.bbcollab.com/collab/ui/session/guest/c1702ac72a8244e6b0f93cf5bef… November 6, 2023 Prof Adam Elmachtoub, Columbia University, USA Title: Smart Predict-then Optimize for Contextual Linear Optimization: Theory and Computation Link to talk: https://eu.bbcollab.com/collab/ui/session/guest/40a20d4cc309494fa78f3d0b881… November 13, 2023 Prof Martin Schmidt, Trier University, Germany Title: The Minimum Sum-of-Squares Clustering Problem: Robustification and Global Optimization Techniques Link to talk: https://eu.bbcollab.com/collab/ui/session/guest/0a4bbb97d3fa49c589ec644496e… November 20, 2023 Prof Emilia Gomez, Joint Research Centre, European Commission & Universitat Pompeu Fabra, Spain Title: Scientific challenges, practical methodologies and policy perspectives for trustworthy AI Link to talk: https://eu.bbcollab.com/collab/ui/session/guest/186b1c65f74b4189ad852fb9ab0… November 27, 2023 Prof Jordi Castro, Universitat Politecnica de Catalunya, Spain Title: An interior-point solver for large structured optimization and (data science and alternative) applications Link to talk: https://eu.bbcollab.com/collab/ui/session/guest/e80c02d25f9b489f8f3c6e644ed… December 4, 2023 Prof Bilge Atasoy, Delft University of Technology, The Netherlands Title: Adaptive Transport Systems through Operations Research, Behavioral Modeling and Machine Learning Link to talk: https://eu.bbcollab.com/guest/0953c0928387448397ba36a45eaef74d Looking forward to e-seeing you there! The organizers of the Online Seminar Series Machine Learning NeEDS Mathematical Optimization Emilio Carrizosa, IMUS-Instituto de Matemáticas de la Universidad de Sevilla Nuria Gómez-Vargas, IMUS-Instituto de Matemáticas de la Universidad de Sevilla Thomas Halskov, Copenhagen Business School Dolores Romero Morales, Copenhagen Business School

1 0

Location related references collected in Sept 2023
by Frank Plastria 18 Sep '23

18 Sep '23

Dear ewgla member, Please find below (and attached in Bibtexformat) another list of Location related references, now most from this year, but incomplete by far. More next month. Sincerely, Frank Plastria Prof. Em. Frank Plastria BUTO, Vrije Universiteit Brussel frank.plastria(a)vub.be<mailto:frank.plastria@vub.be> [1] Mehdi Alizadeh, Mir Saman Pishvaee, Hamed Jahani, Mohammad Mahdi Paydar, and Ahmad Makui. Viable healthcare supply chain network design for a pandemic. Annals of Operations Research, 328(1):35--73, sep 2022. [ DOI<http://dx.doi.org/10.1007/s10479-022-04934-7> ] [2] Sumayah Al-Rabiaah, Manar Hosny, and Sarab AlMuhaideb. An efficient greedy randomized heuristic for the maximum coverage facility location problem with drones in healthcare. Applied Sciences, 12(3):1403, jan 2022. [ DOI<http://dx.doi.org/10.3390/app12031403> ] [3] Elif Bozkaya, Levent Eriskin, and Mumtaz Karatas. Data analytics during pandemics: a transportation and location planning perspective. Annals of Operations Research, 328(1):193--244, aug 2022. [ DOI<http://dx.doi.org/10.1007/s10479-022-04884-0> ] [4] Fariba Goodarzian, Ali Navaei, Behdad Ehsani, Peiman Ghasemi, and Jesús Muñuzuri. Designing an integrated responsive-green-cold vaccine supply chain network using internet-of-things: artificial intelligence-based solutions. Annals of Operations Research, 328(1):531--575, may 2022. [ DOI<http://dx.doi.org/10.1007/s10479-022-04713-4> ] [5] Soheyl Khalilpourazari and Hossein Hashemi Doulabi. A flexible robust model for blood supply chain network design problem. Annals of Operations Research, 328(1):701--726, apr 2022. [ DOI<http://dx.doi.org/10.1007/s10479-022-04673-9> ] [6] Ghazale Kordi, Parsa Hasanzadeh-Moghimi, Mohammad Mahdi Paydar, and Ebrahim Asadi-Gangraj. A multi-objective location-routing model for dental waste considering environmental factors. Annals of Operations Research, 328(1):755--792, jun 2022. [ DOI<http://dx.doi.org/10.1007/s10479-022-04794-1> ] [7] Mohsen Momenitabar, Zhila Dehdari Ebrahimi, Mohammad Arani, and Jeremy Mattson. Robust possibilistic programming to design a closed-loop blood supply chain network considering service-level maximization and lateral resupply. Annals of Operations Research, 328(1):859--901, sep 2022. [ DOI<http://dx.doi.org/10.1007/s10479-022-04930-x> ] [8] Vladimir Simic, Ali Ebadi Torkayesh, and Abtin Ijadi Maghsoodi. Locating a disinfection facility for hazardous healthcare waste in the COVID-19 era: a novel approach based on fermatean fuzzy ITARA-MARCOS and random forest recursive feature elimination algorithm. Annals of Operations Research, 328(1):1105--1150, jul 2022. [ DOI<http://dx.doi.org/10.1007/s10479-022-04822-0> ] [9] Méziane Aider, Imene Dey, and Mhand Hifi. A hybrid population-based algorithm for solving the fuzzy capacitated maximal covering location problem. Computers & Industrial Engineering, 177:108982, mar 2023. [ DOI<http://dx.doi.org/10.1016/j.cie.2023.108982> ] [10] Leilanaz Akbari, Ahmad Kazemi, and Majid Salari. Operational planning of vehicles for rescue and relief operations considering the unavailability of the relocated vehicles. Socio-Economic Planning Sciences, 88:101652, aug 2023. [ DOI<http://dx.doi.org/10.1016/j.seps.2023.101652> ] [11] Beste Akbas and Ayse Selin Kocaman. A planar facility location -allocation problem with fixed and/or variable cost structures for rural electrification. Computers & Operations Research, 154:106202, jun 2023. [ DOI<http://dx.doi.org/10.1016/j.cor.2023.106202> ] [12] Maria Albareda-Sambola, Mercedes Landete, Juan F. Monge, and José L. Sainz-Pardo. An exact approach for the reliable fixed-charge location problem with capacity constraints. European Journal of Operational Research, 311(1):24--35, nov 2023. [ DOI<http://dx.doi.org/10.1016/j.ejor.2023.04.017> ] [13] Reza Alikhani, Majid Eskandarpour, and Hamed Jahani. Collaborative distribution network design with surging demand and facility disruptions. International Journal of Production Economics, 262:108912, aug 2023. [ DOI<http://dx.doi.org/10.1016/j.ijpe.2023.108912> ] [14] Afaf Aloullal, Francisco Saldanha da Gama, and Raca Todosijević. Multi-period single-allocation hub location-routing: Models and heuristic solutions. European Journal of Operational Research, feb 2023. [ DOI<http://dx.doi.org/10.1016/j.ejor.2023.02.003> ] [15] Alireza Amini, Reza Tavakkoli-Moghaddam, Sadoullah Ebrahimnejad, and Ali Ghodratnama. Mathematical modeling of a competitive transportation-location arc routing problem. Computers & Industrial Engineering, 182:109400, aug 2023. [ DOI<http://dx.doi.org/10.1016/j.cie.2023.109400> ] [16] Laura Anton-Sanchez, Mercedes Landete, and Francisco Saldanha da Gama. The discrete p-center location problem with upgrading. Omega, 119:102894, sep 2023. [ DOI<http://dx.doi.org/10.1016/j.omega.2023.102894> ] [17] Homa Ataei and Mansoor Davoodi. The p-center problem under locational uncertainty of demand points. Discrete Optimization, 47:100759, feb 2023. [ DOI<http://dx.doi.org/10.1016/j.disopt.2023.100759> ] [18] Pasquale Avella, Alice Calamita, and Laura Palagi. A compact formulation for the base station deployment problem in wireless networks. Networks, 82(1):52--67, apr 2023. [ DOI<http://dx.doi.org/10.1002/net.22146> ] [19] Igor Averbakh and Wei Yu. The probabilistic uncapacitated open vehicle routing location problem. Networks, 82(1):68--83, apr 2023. [ DOI<http://dx.doi.org/10.1002/net.22147> ] [20] Aritra Banik, Rajiv Raman, and Saurabh Ray. On the geometric priority set cover problem. Computational Geometry, 112:101984, jun 2023. [ DOI<http://dx.doi.org/10.1016/j.comgeo.2023.101984> ] [21] Simanta Barman and Michael W. Levin. Throughput properties and optimal locations for limited deployment of max-pressure controls. Transportation Research Part C: Emerging Technologies, 150:104105, may 2023. [ DOI<http://dx.doi.org/10.1016/j.trc.2023.104105> ] [22] Mario José Basallo-Triana, Juan José Bravo-Bastidas, Ivan Contreras, Jean-François Cordeau, and Carlos Julio Vidal-Holguín. Intermodal hub network design with generalized capacity constraints and non-synchronized train -truck operations. Transportation Research Part B: Methodological, 174:102770, aug 2023. [ DOI<http://dx.doi.org/10.1016/j.trb.2023.05.007> ] [23] Tomáš Bayer, Ivana Kolingerová, Markéta Potůčková, Miroslav Čábelka, and Eva Štefanová. An incremental facility location clustering with a new hybrid constrained pseudometric. Pattern Recognition, 141:109520, sep 2023. [ DOI<http://dx.doi.org/10.1016/j.patcog.2023.109520> ] [24] Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion, and Thomas Ridremont. Robust capacitated steiner trees and networks with uniform demands. Networks, 82(1):3--31, mar 2023. [ DOI<http://dx.doi.org/10.1002/net.22143> ] [25] Canser Bilir. Effect of demand uncertainty on omnichannel distribution network design strategies. International Transactions in Operational Research, may 2023. [ DOI<http://dx.doi.org/10.1111/itor.13310> ] [26] Víctor Blanco, Ricardo Gázquez, Diego Ponce, and Justo Puerto. A branch-and-price approach for the continuous multifacility monotone ordered median problem. European Journal of Operational Research, 306(1):105--126, apr 2023. [ DOI<http://dx.doi.org/10.1016/j.ejor.2022.07.020> ] [27] Víctor Blanco, Elena Fernández, and Yolanda Hinojosa. Hub location with protection under interhub link failures. INFORMS Journal on Computing, may 2023. [ DOI<http://dx.doi.org/10.1287/ijoc.2023.1296> ] [28] Víctor Blanco and Ricardo Gázquez. Fairness in maximal covering location problems. Computers & Operations Research, 157:106287, sep 2023. [ DOI<http://dx.doi.org/10.1016/j.cor.2023.106287> ] [29] Rafael Blanquero, Emilio Carrizosa, Boglárka G.-Tóth, and Kristóf Kovács. Solving the 1-median problem on a network with continuous demand and demand surplus. Computers & Operations Research, 160:106399, dec 2023. [ DOI<http://dx.doi.org/10.1016/j.cor.2023.106399> ] [30] Marin Bougeret, Jérémy Omer, and Michael Poss. Optimization problems in graphs with locational uncertainty. INFORMS Journal on Computing, 35(3):578--592, mar 2023. [ DOI<http://dx.doi.org/10.1287/ijoc.2023.1276> ] [31] Kirk Boyer, Paul Horn, and Mario A. Lopez. Extremal problems on ray sensor configurations. Discrete Applied Mathematics, 332:87--100, jun 2023. [ DOI<http://dx.doi.org/10.1016/j.dam.2023.01.005> ] [32] Sergio Cabello. Faster distance-based representative skyline and k-center along pareto front in the plane. Journal of Global Optimization, 86(2):441--466, mar 2023. [ DOI<http://dx.doi.org/10.1007/s10898-023-01280-1> ] [33] Yutong Cai, Ghim Ping Ong, and Qiang Meng. Bicycle sharing station planning: From free-floating to geo-fencing. Transportation Research Part C: Emerging Technologies, 147:103990, feb 2023. [ DOI<http://dx.doi.org/10.1016/j.trc.2022.103990> ] [34] Davide Cazzaro, David Franz Koza, and David Pisinger. Combined layout and cable optimization of offshore wind farms. European Journal of Operational Research, may 2023. [ DOI<http://dx.doi.org/10.1016/j.ejor.2023.04.046> ] [35] Cihan Çetinkaya, Mehmet Erbas, Mehmet Kabak, and Eren Özceylan. A mass vaccination site selection problem: An application of GIS and entropy-based MAUT approach. Socio-Economic Planning Sciences, 85:101376, feb 2023. [ DOI<http://dx.doi.org/10.1016/j.seps.2022.101376> ] [36] Timothy M. Chan. Faster algorithms for largest empty rectangles and boxes. Discrete & Computational Geometry, 70(2):355--375, jan 2023. [ DOI<http://dx.doi.org/10.1007/s00454-022-00473-x> ] [37] Kuo-Hao Chang, Tzu-Li Chen, Fu-Hao Yang, and Tzu-Yin Chang. Simulation optimization for stochastic casualty collection point location and resource allocation problem in a mass casualty incident. European Journal of Operational Research, feb 2023. [ DOI<http://dx.doi.org/10.1016/j.ejor.2023.01.065> ] [38] Yunkai Chen, Quanwu Zhao, Wei Wang, and Shu Zhang. Mixed multi-echelon location routing problem with differentiated intermediate depots. Computers & Industrial Engineering, 177:109026, mar 2023. [ DOI<http://dx.doi.org/10.1016/j.cie.2023.109026> ] [39] Yuehong Chen, Guohao Wu, Yu Chen, and Zelong Xia. Spatial location optimization of fire stations with traffic status and urban functional areas. Applied Spatial Analysis and Policy, jan 2023. [ DOI<http://dx.doi.org/10.1007/s12061-023-09502-5> ] [40] Liang Chen, Sheng-Jie Chen, Wei-Kun Chen, Yu-Hong Dai, Tao Quan, and Juan Chen. Efficient presolving methods for solving maximal covering and partial set covering location problems. European Journal of Operational Research, 311(1):73--87, nov 2023. [ DOI<http://dx.doi.org/10.1016/j.ejor.2023.04.044> ] [41] Aixia Chen and Yankui Liu. Optimizing sustainable biomass-coal co-firing power plant location problem under ambiguous supply. Computers & Industrial Engineering, 182:109401, aug 2023. [ DOI<http://dx.doi.org/10.1016/j.cie.2023.109401> ] [42] Linlin Chen, Shuihua Han, Zhen Ye, and Senmao Xia. The optimisation of the location of front distribution centre: A spatio-temporal joint perspective. International Journal of Production Economics, 263:108950, sep 2023. [ DOI<http://dx.doi.org/10.1016/j.ijpe.2023.108950> ] [43] Jongmin Choi, Dahye Jeong, and Hee-Kap Ahn. Covering convex polygons by two congruent disks. Computational Geometry, 109:101936, feb 2023. [ DOI<http://dx.doi.org/10.1016/j.comgeo.2022.101936> ] [44] Richard L. Church, Zvi Drezner, and Pawel Kalczynski. Extensions to the planar p-median problem. Annals of Operations Research, 326(1):115--135, apr 2023. [ DOI<http://dx.doi.org/10.1007/s10479-023-05279-5> ] [45] Jake Clarkson, Kyle Y. Lin, and Kevin D. Glazebrook. A classical search game in discrete locations. Mathematics of Operations Research, 48(2):687--707, may 2023. [ DOI<http://dx.doi.org/10.1287/moor.2022.1279> ] [46] Nicolás Clavijo-Buritica, Laura Triana-Sanchez, and John Willmer Escobar. A hybrid modeling approach for resilient agri-supply network design in emerging countries: Colombian coffee supply chain. Socio-Economic Planning Sciences, 85:101431, feb 2023. [ DOI<http://dx.doi.org/10.1016/j.seps.2022.101431> ] [47] René Corbet, Michael Kerber, Michael Lesnick, and Georg Osang. Computing the multicover bifiltration. Discrete & Computational Geometry, 70(2):376--405, feb 2023. [ DOI<http://dx.doi.org/10.1007/s00454-022-00476-8> ] [48] Davide Croci, Ola Jabali, and Federico Malucelli. The balanced p-median problem with unitary demand. Computers & Operations Research, 155:106242, jul 2023. [ DOI<http://dx.doi.org/10.1016/j.cor.2023.106242> ] [49] Janiele Custodio and Hernan Abeledo. Drone-based environmental emergency response in the brazilian amazon. Drones, 7(9):554, aug 2023. [ DOI<http://dx.doi.org/10.3390/drones7090554> ] [50] Tien Thanh Dam, Thuy Anh Ta, and Tien Mai. Robust maximum capture facility location under random utility maximization models. European Journal of Operational Research, 310(3):1128--1150, nov 2023. [ DOI<http://dx.doi.org/10.1016/j.ejor.2023.04.024> ] [51] Mohammad Daneshvar, Sanjay Dominik Jena, and Walter Rei. A two-stage stochastic post-disaster humanitarian supply chain network design problem. Computers & Industrial Engineering, 183:109459, sep 2023. [ DOI<http://dx.doi.org/10.1016/j.cie.2023.109459> ] [52] Arun Kumar Das, Sandip Das, and Joydeep Mukherjee. Approximation algorithms for orthogonal line centers. Discrete Applied Mathematics, 338:69--76, oct 2023. [ DOI<http://dx.doi.org/10.1016/j.dam.2023.05.014> ] [53] Kraig Delana, Sarang Deo, Kamalini Ramdas, Ganesh-Babu B. Subburaman, and Thulasiraj Ravilla. Multichannel delivery in healthcare: The impact of telemedicine centers in southern india. Management Science, 69(5):2568--2586, may 2023. [ DOI<http://dx.doi.org/10.1287/mnsc.2022.4488> ] [54] Antonio Diglio, Juanjo Peiró, Carmela Piccolo, and Francisco Saldanha da Gama. Approximation schemes for districting problems with probabilistic constraints. European Journal of Operational Research, 307(1):233--248, may 2023. [ DOI<http://dx.doi.org/10.1016/j.ejor.2022.09.005> ] [55] Zvi Drezner, Jack Brimberg, and Anita Schöbel. A trajectory based heuristic for the planar p-median problem. Computers & Operations Research, 158:106296, oct 2023. [ DOI<http://dx.doi.org/10.1016/j.cor.2023.106296> ] [56] Zvi Drezner and Dawit Zerom. Competitive facility location under attrition. Computational Management Science, 20(1), aug 2023. [ DOI<http://dx.doi.org/10.1007/s10287-023-00473-z> ] [57] Okan Dukkanci, Achim Koberstein, and Bahar Y. Kara. Drones for relief logistics under uncertainty after an earthquake. European Journal of Operational Research, mar 2023. [ DOI<http://dx.doi.org/10.1016/j.ejor.2023.02.038> ] [58] H. A. Eiselt, Vladimir Marianov, and Joyendu Bhadury. Multicriteria Location Analysis. Springer International Publishing, 2023. [ DOI<http://dx.doi.org/10.1007/978-3-031-23876-5> ] [59] Amin Eshkiti, Fatemeh Sabouhi, and Ali Bozorgi-Amiri. A data-driven optimization model to response to COVID-19 pandemic: a case study. Annals of Operations Research, 328(1):337--386, jun 2023. [ DOI<http://dx.doi.org/10.1007/s10479-023-05320-7> ] [60] Inmaculada Espejo, Alfredo Marín, Juan M. Muñoz-Ocaña, and Antonio M. Rodríguez-Chía. A new formulation and branch-and-cut method for single-allocation hub location problems. Computers & Operations Research, 155:106241, jul 2023. [ DOI<http://dx.doi.org/10.1016/j.cor.2023.106241> ] [61] Sherif A. Fahmy, Areej M. Zaki, and Yomna H. Gaber. Optimal locations and flow allocations for aggregation hubs in supply chain networks of perishable products. Socio-Economic Planning Sciences, 86:101500, apr 2023. [ DOI<http://dx.doi.org/10.1016/j.seps.2022.101500> ] [62] Mojtaba Farrokh, Ehsan Ahmadi, and Minghe Sun. A robust stochastic possibilistic programming model for dynamic supply chain network design with pricing and technology selection decisions. OPSEARCH, 60(3):1082--1120, may 2023. [ DOI<http://dx.doi.org/10.1007/s12597-023-00643-2> ] [63] Jafar Fathali and Mehdi Zaferanieh. The balanced 2-median and 2-maxian problems on a tree. Journal of Combinatorial Optimization, 45(2), feb 2023. [ DOI<http://dx.doi.org/10.1007/s10878-023-00997-9> ] [64] Xin Feng. Multiplant location involving resource allocation. Geographical Analysis, may 2023. [ DOI<http://dx.doi.org/10.1111/gean.12366> ] [65] Carlo Filippi, Gianfranco Guastaroba, Lorenzo Peirano, and M. Grazia Speranza. Incorporating time-dependent demand patterns in the optimal location of capacitated charging stations. Transportation Research Part C: Emerging Technologies, 152:104145, jul 2023. [ DOI<http://dx.doi.org/10.1016/j.trc.2023.104145> ] [66] Vera Fischer and Sanne Wøhlk. A logic-based benders decomposition solution approach for two covering problems that consider the underlying transportation. Computers & Operations Research, 160:106393, dec 2023. [ DOI<http://dx.doi.org/10.1016/j.cor.2023.106393> ] [67] Martina Fischetti and Matteo Fischetti. Integrated layout and cable routing in wind farm optimal design. Management Science, 69(4):2147--2164, apr 2023. [ DOI<http://dx.doi.org/10.1287/mnsc.2022.4470> ] [68] Caio César De Freitas, Dario José Aloise, Fábio Francisco Da Costa Fontes, Andréa Cynthia Santos, and Matheus Da Silva Menezes. A biased random-key genetic algorithm for the two-level hub location routing problem with directed tours. OR Spectrum, 45(3):903--924, apr 2023. [ DOI<http://dx.doi.org/10.1007/s00291-023-00718-y> ] [69] Rachel Friederich, Anirban Ghosh, Matthew Graham, Brian Hicks, and Ronald Shevchenko. Experiments with unit disk cover algorithms for covering massive pointsets. Computational Geometry, 109:101925, feb 2023. [ DOI<http://dx.doi.org/10.1016/j.comgeo.2022.101925> ]

1 0

Location related references August 2023
by Frank Plastria 16 Aug '23

16 Aug '23

Here is another list of references. Enjoy. Frank Prof. Em. Frank Plastria BUTO, Vrije Universiteit Brussel frank.plastria(a)vub.be [1] Milad Mohammadi and Alibakhsh Nikzad. Sustainable and reliable closed-loop supply chain network design during pandemic outbreaks and disruptions. Operations Management Research, 16(2):969--991, aug 2022. [ DOI<http://dx.doi.org/10.1007/s12063-022-00312-5> ] [2] Alberto Del Pia and Mingchen Ma. k-median: exact recovery in the extended stochastic ball model. Mathematical Programming, 200(1):357--423, oct 2022. [ DOI<http://dx.doi.org/10.1007/s10107-022-01886-5> ] [3] Renan Vicente Pinto and Nelson Maculan. A new heuristic for the euclidean Steiner tree problem in rn. TOP, 31(2):391--413, sep 2022. [ DOI<http://dx.doi.org/10.1007/s11750-022-00642-4> ] [4] Frank Plastria and Francisco Guevara. Segmented pseudometrics and four-point fermat-torricelli problems. Optimization, 72(8):2155--2173, mar 2022. [ DOI<http://dx.doi.org/10.1080/02331934.2022.2057307> ] [5] Jaroslav Pluskal, Radovan Šomplák, Dušan Hrabec, Vlastimír Nevrlý, and Lars Magnus Hvattum. Optimal location and operation of waste-to-energy plants when future waste composition is uncertain. Operational Research, 22(5):5765--5790, may 2022. [ DOI<http://dx.doi.org/10.1007/s12351-022-00718-w> ] [6] Xinqiang Qian, Xiucui Guan, Junhua Jia, Qiao Zhang, and Panos M. Pardalos. Vertex quickest 1-center location problem on trees and its inverse problem under weighted l norm. Journal of Global Optimization, 85(2):461--485, jul 2022. [ DOI<http://dx.doi.org/10.1007/s10898-022-01212-5> ] [7] E. A. Papa Quiroz, A. Soubeyran, and P. R. Oliveira. Coercivity and generalized proximal algorithms: applicationtraveling around the world. Annals of Operations Research, 321(1-2):451--467, apr 2022. [ DOI<http://dx.doi.org/10.1007/s10479-022-04725-0> ] [8] Motahareh Rabbani, Seyyed Mohammad Hadji Molana, Seyed Mojtaba Sajadi, and Mohammad Hossein Davoodi. Sustainable fertilizer supply chain network design using evolutionary-based resilient robust stochastic programming. Computers & Industrial Engineering, 174:108770, dec 2022. [ DOI<http://dx.doi.org/10.1016/j.cie.2022.108770> ] [9] Rajiv Raman and Saurabh Ray. On the geometric set multicover problem. Discrete & Computational Geometry, 68(2):566--591, jun 2022. [ DOI<http://dx.doi.org/10.1007/s00454-022-00402-y> ] [10] Simeon Reich and Truong Minh Tuyen. The generalized Fermat-Torricelli problem in Hilbert spaces. Journal of Optimization Theory and Applications, 196(1):78--97, sep 2022. [ DOI<http://dx.doi.org/10.1007/s10957-022-02113-z> ] [11] Ahmed Saif and Nazanin Madani. Robust design of service systems with immobile servers under demand uncertainty. Computers & Operations Research, 148:105965, dec 2022. [ DOI<http://dx.doi.org/10.1016/j.cor.2022.105965> ] [12] Eyden Samunderu, , and Otto Hahn Hahn and. Reconfiguring a multi-period facility modelan empirical test in a dynamic setting. BOHR International Journal of Operations Management Research and Practices, 1(1):17--27, 2022. [ DOI<http://dx.doi.org/10.54646/bijomrp.2022.03> ] [13] Firlan Sbastian, Ari Yanuar Ridwan, and Nia Novitasari. Feasibility analysis of financial aspect in determining optimal last mile warehouse location using p-median method. In Proceedings of the Conference on Broad Exposure to Science and Technology 2021 (BEST 2021). Atlantis Press, 2022. [ DOI<http://dx.doi.org/10.2991/aer.k.220131.050> ] [14] Nazmi Sener and Orhan Feyzioglu. Multiple allocation hub covering flow problem under uncertainty. Annals of Operations Research, 320(2):975--997, feb 2022. [ DOI<http://dx.doi.org/10.1007/s10479-022-04553-2> ] [15] Mehmet Burak Senol and Ekrem Alper Murat. A sequential solution heuristic for continuous facility layout problems. Annals of Operations Research, 320(1):355--377, oct 2022. [ DOI<http://dx.doi.org/10.1007/s10479-022-04907-w> ] [16] Zhixuan Shao, Maximilien Meyrieux, and Mustafa Kumral. Optimal junction localization minimizing maximum miners' evacuation distance in underground mining network. Mining Technology, pages 1--14, dec 2022. [ DOI<http://dx.doi.org/10.1080/25726668.2022.2159307> ] [17] Karmel S. Shehadeh and Emily L. Tucker. Stochastic optimization models for location and inventory prepositioning of disaster relief supplies. Transportation Research Part C: Emerging Technologies, 144:103871, nov 2022. [ DOI<http://dx.doi.org/10.1016/j.trc.2022.103871> ] [18] Iman Shokr, Fariborz Jolai, and Ali Bozorgi-Amiri. A collaborative humanitarian relief chain design for disaster response. Computers & Industrial Engineering, 172:108643, oct 2022. [ DOI<http://dx.doi.org/10.1016/j.cie.2022.108643> ] [19] Jia Shu, Miao Song, Beilun Wang, Jing Yang, and Shaowen Zhu. Humanitarian relief network design: Responsiveness maximization and a case study of typhoon rammasun. IISE Transactions, 55(3):301--313, jun 2022. [ DOI<http://dx.doi.org/10.1080/24725854.2022.2074577> ] [20] M. Tadaros and A. Migdalas. Bi- and multi-objective location routing problems: classification and literature review. Operational Research, 22(5):4641--4683, sep 2022. [ DOI<http://dx.doi.org/10.1007/s12351-022-00734-w> ] [21] Kübra Taninmis and Markus Sinnl. A branch-and-cut algorithm for submodular interdiction games. INFORMS Journal on Computing, 34(5):2634--2657, sep 2022. [ DOI<http://dx.doi.org/10.1287/ijoc.2022.1196> ] [22] Rafael D. Tordecilla, Jairo R. Montoya-Torres, Carlos L. Quintero-Araujo, Javier Panadero, and Angel A. Juan. The location routing problem with facility sizing decisions. International Transactions in Operational Research, 30(2):915--945, feb 2022. [ DOI<http://dx.doi.org/10.1111/itor.13125> ] [23] Yu-Chung Tsao, Tsehaye Dedimas Beyene, Vo-Van Thanh, and Sisay G. Gebeyehu. Power distribution network design considering dynamic and differential pricing, buy-back, and carbon trading. Computers & Industrial Engineering, 172:108567, oct 2022. [ DOI<http://dx.doi.org/10.1016/j.cie.2022.108567> ] [24] Mohammad H. Vahidnia, Hossein Vahidi, Madjid Ghodsi Hassanabad, and Maryam Shafiei. A spatial decision support system based on a hybrid AHP and TOPSIS method for fire station site selection. Journal of Geovisualization and Spatial Analysis, 6(2), oct 2022. [ DOI<http://dx.doi.org/10.1007/s41651-022-00125-x> ] [25] Sandra M. Venske, Carolina P. Almeida, Ricardo Lüders, and Myriam R. Delgado. Selection hyper-heuristics for the multi and many-objective quadratic assignment problem. Computers & Operations Research, 148:105961, dec 2022. [ DOI<http://dx.doi.org/10.1016/j.cor.2022.105961> ] [26] Haitao Wang. On the planar two-center problem and circular hulls. Discrete & Computational Geometry, 68(4):1175--1226, jan 2022. [ DOI<http://dx.doi.org/10.1007/s00454-021-00358-5> ] [27] Wei Wang, Shuaian Wang, Lu Zhen, and Xiaobo Qu. EMS location-allocation problem under uncertainties. Transportation Research Part E: Logistics and Transportation Review, 168:102945, dec 2022. [ DOI<http://dx.doi.org/10.1016/j.tre.2022.102945> ] [28] Zhaodong Wang, Siyang Xie, and Yanfeng Ouyang. Planning reliable service facility location against disruption risks and last-mile congestion in a continuous space. Transportation Research Part B: Methodological, 165:123--140, nov 2022. [ DOI<http://dx.doi.org/10.1016/j.trb.2022.09.005> ] [29] Huihui Wang, Shu-Cherng Fang, Min Huang, Qihuan Zhang, and Zhibin Deng. A joint model of location, inventory and third-party logistics provider in supply chain network design. Computers & Industrial Engineering, 174:108809, dec 2022. [ DOI<http://dx.doi.org/10.1016/j.cie.2022.108809> ] [30] Peng Wu, Feng Chu, Nasreddine Saidani, Haoxun Chen, and MengChu Zhou. Optimizing locations and qualities of multiple facilities with competition via intelligent search. IEEE Transactions on Intelligent Transportation Systems, 23(6):5092--5105, jun 2022. [ DOI<http://dx.doi.org/10.1109/tits.2020.3046885> ] [31] Peng Wu, Yun Wang, Junheng Cheng, and Yantong Li. An improved mixed-integer programming approach for bi-objective parallel machine scheduling and location. Computers & Industrial Engineering, 174:108813, dec 2022. [ DOI<http://dx.doi.org/10.1016/j.cie.2022.108813> ] [32] Xi Xiang, Tao Fang, Changchun Liu, and Zhi Pei. Robust service network design problem under uncertain demand. Computers & Industrial Engineering, 172:108615, oct 2022. [ DOI<http://dx.doi.org/10.1016/j.cie.2022.108615> ] [33] Wuyang Yu. Robust competitive facility location model with uncertain demand types. PLOS ONE, 17(8):e0273123, aug 2022. [ DOI<http://dx.doi.org/10.1371/journal.pone.0273123> ] [34] Wuyang Yu and. A continuum perspective of customer choice rules for competitive facility location problems. Journal of Industrial and Management Optimization, 0(0):0--0, 2022. [ DOI<http://dx.doi.org/10.3934/jimo.2022229> ] [35] Shokufeh Zamani, Jamal Arkat, and Seyed Taghi Akhavan Niaki. Service interruption and customer withdrawal in the congested facility location problem. Transportation Research Part E: Logistics and Transportation Review, 165:102866, sep 2022. [ DOI<http://dx.doi.org/10.1016/j.tre.2022.102866> ] [36] Jianfeng Zheng, Lingxiao Yang, Lina Ni, Kjetil Fagerholt, and Yan Zhang. Efficient models for the liner shipping hub location problem with spatial structure. Computers & Industrial Engineering, 173:108725, nov 2022. [ DOI<http://dx.doi.org/10.1016/j.cie.2022.108725> ] [37] Yujing Zheng, Yuxiong Ji, Yu Shen, Bing Liu, and Yuchuan Du. Hub location problem considering spoke links with incentive-dependent capacities. Computers & Operations Research, 148:105959, dec 2022. [ DOI<http://dx.doi.org/10.1016/j.cor.2022.105959> ] [38] Elham Ziar, Mehdi Seifbarghy, Mahdi Bashiri, and Benny Tjahjono. An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach. Annals of Operations Research, 322(2):1143--1166, dec 2022. [ DOI<http://dx.doi.org/10.1007/s10479-022-05117-0> ]

1 0

← Newer
1
2
3
4
5
6
7
8
9
...
32
Older →

Jump to page:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

Ewgla