Search LUMS
-
Thu Huong Dang (2022) Exact and heuristic approaches to arc routing problems. ... 4th Workshop on Arc Routing Problems.
-
Thu Huong Dang (2022) Exact and heuristic approaches to arc routing problems. ... 4th Workshop on Arc Routing Problems.
-
My PhD research was with the STOR-i CDT, using exact algorithms and heuristic methods for large-scale and complex Vehicle Routing Problems. ... Improving a constructive heuristic for the general routing problem.
-
Combinatorial optimisation. Exact and (meta-) heuristic solution algorithms. Multi-objective optimisation. The vehicle routing problem. ... He is particularly interested in the vehicle routing problem with environmental considerations, and facilitating
-
Show more…. Research Overview. Dr. Liu is interested in the interjunction field of Forecasting and Optimisation, which involves demand forecasting, inventory management, vehicle routing, scheduling, and so on. ... The newsvendor problem. The
-
Green Logistics, Vehicle Routing and Scheduling Problems. Show more…. Research Interests. ... Heuristic methods and integer programming for combinatorial optimisation problems, particularly with application to vehicle routing & scheduling and other
-
Research Overview. My research is focused on optimising real-life problems by using mathematical models. ... The current problems I am dealing with are from the areas of public and shared-use transport, offshore windfarms, airport slot allocation, waste
-
The multi-visit drone routing problem for pickup and delivery services. ... A vehicle routing problem with distribution uncertainty in deadlines.
-
and Dr Anna-Lena Sachs work on optimal policies for stochastic resource-allocation problems. ... and Dr Jamie Fairbrother are mainly interested in developing models and algorithms for practical problems which arise in the context of logistics, such as
-
My PhD research was with the STOR-i CDT, using exact algorithms and heuristic methods for large-scale and complex Vehicle Routing Problems. ... Improving a constructive heuristic for the general routing problem.