The 23rd EURO Working Group on Locational Analysis meeting will be held in conjunction with the 7th International Workshop on Locational Analysis and Related Problems on September 14-16, 2016 at Malaga, Spain
The meeting intends to gather the operations research community from different parts of the world to share experiences in the field of locational analysis. We invite participation from all areas related to location theory including: network location, continuous location, discrete location, obnoxious location, competitive location, hub location, location-routing, advanced location models, location applications (logistics, network design), exact and heuristic solution methods.
Contributions are welcome from academia, industry or the public sector. In aliition to presentations, the meeting is intended to be a forum for exchange of recent experiences and results. Researchers and practitioners are invited to submit an abstract formatted according to the given templates. The submissions will be evaluated by a designated scientific committee. We also offer the possibility to present short communications or ongoing works in the form of poster sessions.
Janny Leung obtained an S.B. degree in Applied Mathematics from Radcliffe College, a B.A. in Mathematics from Oxford University and a Ph.D. in Operations Research from the Massachusetts Institute of Technology. Before returning to Hong Kong, she was a faculty member at Yale University and the University of Arizona.
Her main research interests are combinatorial optimization and logistics; she has investigated problems in public transit scheduling, supplier selection, material handling, routing and distribution planning, facility layout, production scheduling and baseball timetabling.
Currently, she serves on the editorial boards of EURO Journal on Transportation and Logistics (since 2011), Transportation Science (since 2009), IIE Transactions (since 2001), Computers & Operations Research (since 2005) and Naval Research Logistics (since 2001). She is an active member of INFORMS, having served as President of the Forum on Women in OR/MS (2002) and Chair of the Student Affairs Committee (2000-2004). She was the Scientific Programme Chair for the 19th triennial conference of the International Federation of Operational Research Societies (IFORS) held in Melbourne in 2011.
Paolo Toth took his degree in Electronic Engineering at the University of Bologna in the academic year 1964-65. From 1968 to 1972 and from 1972 to 1980 he was, respectively, Assistant Professor and Associate Professor of Computer Science at the Faculty of Engineering of the University of Bologna. From November 1980 to October 1983 he was Full Professor of Automatic Control at the Faculty of Engineering of the University of Florence. From November 1983 to December 2011 he was Full Professor and from January 2012 to October 2014 he was "Alma Mater Professor" of Combinatorial Optimization (Operational Research area) at DEIS (Dipartimento di Elettronica, Informatica e Sistemistica), Faculty of Engineering of the University of Bologna. From October 2014 he is currently "Professor Emeritus" of the University of Bologna.
His current main research interests include Operational Research and Mathematical Programming methodologies and, in particular, the design and implementation of effective exact and heuristic algorithms for Combinatorial Optimization and Graph Theory problems, and their application to real-world Transportation, Logistics, Loading, Routing, Crew Management, Railway Optimization problems.
He is currently member of the Editorial Boards of the journals: "European Journal of Operational Research", "Journal of Heuristics", "Journal of the Operational Research Society", "Discrete Optimization", "Discrete Applied Mathematics", "International Transactions in Operational Research", "EURO Journal on Transportation and Logistics", "Algorithmic Operations Research", "Journal of Operations and Logistics", "Public Transport", "ORiON", "Pesquisa Operacional", "RAIRO".
All participants wishing to present a talk at the workshop should prepare an extended abstract of up to 2 pages. A pdf version of the complete manuscript should be submitted through the submission system (EasyChair) according to the following templates (Latex, Word).
All submisions will be reviewed by the Scientific Committee. Notification of the decision will be sent to the corresponding author by June 12, 2016.Submit
The conference will be held at the building of the "Cofradía de los Estudiantes", which can be easily reached by walking from any hotel in the city center.
Special rates are available in the following tours through our Technical Secretariat. Please, do not hesitate to contact them for any recommendation.
Most major worldwide airlines (also low-cost airlines) operate flights to Malaga's "Pablo Ruiz Picasso" International Airport (AGP). Located to the south west of the capital, just 8 kilometers from the city center, it is the fourth largest in Spain.
A ride to the city center by taxi should typically cost around 15 EUR depending on traffic conditions. From the airport the city center can also be reached by bus (Express Line A), for one passenger costs 3 EUR. Malaga airport is connected to the city center and Maria Zambrano train station (AVE) by the C1 line, a single ticket costs 1.80 EUR.
Malaga's Maria Zambrano Station is connected to major Spanish cities through the Spanigh High Speed (AVE) network. For timetables and further information about trains see RENFE (National Railway Service) website
Nestling in the shelter of a natural bay, the port of Malaga handles a huge volume of both commercial and cruise traffic, having become the second most important cruise port in the Iberian peninsula. Further information can be found on the official website.
The bus station is located in a central area of the city, near to the train station, as well as on the airport bus route. Malaga is connected to major cities of Andalusia and the rest of Spain by motorways, the excellent road network makes the bus the ideal way of getting to towns and cities in the Malaga area, the rest of Andalusia and the whole of Spain. Further information on destinations, bus companies, prices and timetables can be found on www.estabus.emtsam.es
Further travel and touristic information about Malaga can be found on the Tourist Information website
(before June 30th)
(from July 1st)
|Student*||130 €||230 €|
|Regular registration||230 €||300 €|
|Accompanying person||130 €|
* Students are required to provide a copy of a valid ID that certifies their full-time student status.
Each registration fee includes:
Each talk lasts 20 minutes including questions. Therefore, your presentation must be fit within 15-18 minutes, leaving time for audience questions.
Please, arrive at your session before its scheduled start in order to check in with the session chair and to set up your presentation.
We will consider the family of optimization problems including both “location” and “routing” aspects. In particular the Capacitated m-Ring-Star Problem (CmRSP) and the Capacitated Location-Routing Problem (CLRP) will be addressed.
In the Capacitated Location-Routing Problem (CLRP), the aim is to determine the depots to be opened, the customers to be assigned to each open depot, and the routes to be performed to fulfill the demand of the customers. The objective is to minimize the sum of the open depot cost, of the used vehicle cost, and of the traveling cost associated with the performed routes. The CLRP is NP-hard, since it generalizes two well-known NP-hard problems: the Capacitated Facility Location Problem (CFLP) and Multi Depot Vehicle Routing Problem (MDVRP).
In the Capacitated m-Ring-Star Problem (CmRSP) the aim is to find m “rings” (simple cycles) visiting a central depot, a subset of customers and a subset of potential (Steiner) nodes, while customers not belonging to any ring must be “allocated” to a visited (customer or Steiner) node. Moreover, the rings must be node-disjoint and the number of customers allocated or visited in a ring cannot be greater than a given capacity Q. The objective is to minimize the total visiting and allocation costs. The CmRSP is NP-hard, since it generalizes the Traveling Salesman Problem.
The most effective metaheuristic algorithms proposed for the solution of the CmRSP and of the CLRP will be described, and experimentally compared on the benchmark instances from the literature, by taking into account the CPU time and the quality of the solutions obtained.
Recent natural and man-made disasters have highlighted the importance of effective logistics planning in and management for humanitarian relief. There are four phases of disaster management -- mitigation, preparedness, response and recovery – each with different focus and time-scale. Thus, different models and methods are needed for the different phases. In the immediate aftermath of a calamity, the agility for quick response may be most important, whereas for longer-term recovery cost-effectiveness might be the objective. This talk will survey the growing literature on operational research models and methods for humanitarian logistics. Some case studies will also be presented.
+34 952 062 654
+34 952 609 060