Papers by Tharinee Manisri
Algorithm for the Multi-Objective Vehicle Routing Problem with Time Windows
This paper focuses on an algorithm for the vehicle routing problem with time windows (VRPTW). It ... more This paper focuses on an algorithm for the vehicle routing problem with time windows (VRPTW). It involves servicing a set of customers, with earliest and latest time deadlines, a constant service time including when the vehicle arrives to the customers. The demands are served by capacitated vehicles with limited travel times to return to the depot. The purpose of this research is to develop a hybrid algorithm that includes a heuristic, a local search and a meta-heuristic algorithm to solve optimization problems with multiple objectives. The first priority aims to find the minimum number of vehicles required and the second priority aims to search for the solution that minimizes the total travel time. The algorithm performances are measured with two criteria: quality of solution and running time. A set of well-known benchmark data and the genetic algorithm are used to compare the quality of solution and running time of the algorithm, respectively. The algorithm is applied to solve the...
In this research, the problem addressed involves sets of practical case studies relating to a thi... more In this research, the problem addressed involves sets of practical case studies relating to a third-party logistics firm that mainly provides services to a big industrial estate in Thailand. This study considers constraints consisting of time windows, multiple trips, multi-product deliveries, a limited number of drivers and mixed fleets with limited and unlimited numbers of available vehicles. An adapted genetic algorithm hybridizes three inter-route search operators, i.e. relocation, exchange and elimination are developed and used to determine the best solution to a heterogeneous fleet vehicle routing problem with various constraints as mentioned previously. The benchmark problem sets do not exactly fit the addressed unique problem; therefore, the performance of the proposed method is evaluated against a branch-and-bound algorithm as a built-in solver. Due to the limitations of the solver for solving large-scale problems, percentage deviations of the solutions with respect to the b...
This research is compared between the meta-heuristic algorithms for heterogeneous fleet and split... more This research is compared between the meta-heuristic algorithms for heterogeneous fleet and split delivery of vehicle routing problem with time windows (VRPTW). The objective is comparing the algorithms that minimize the total travel times. The developing algorithms are including the first best with tabu search (FBTS), the global best with tabu search (GBTS) and tabu search (TS). The performance measures of these three algorithms are the quality of solution and the computer run time. The experiment shows that the FBTS is the best algorithm. It can find an appropriate solution in a reasonable time. The maximum CPUs time is 643 minute when the customer is increasing to 100 nodes.
Kku Engineering Journal, May 30, 2012
A Re-constructed Meta-Heuristic Algorithm for Robust Fleet Size and Mix Vehicle Routing Problem with Time Windows under Uncertain Demands
Proceedings in Adaptation, Learning and Optimization, 2015
Recent work of the fleet size and mix vehicle routing problem with time windows mostly assumes th... more Recent work of the fleet size and mix vehicle routing problem with time windows mostly assumes that the input variables are deterministic. Practice in the real world, however, faces considerable uncertainty in the data. But recent research studies lack emphasis on this uncertainty. This paper focuses to contribute to a new challenging study by considering the customer demand as uncertain. This characteristic increases the difficulty for solving. The meta-heuristic algorithms are developed consisting a modification of a genetic algorithm and an adaptation of a greedy search hybridized with inter-route neighborhood search methods. Because this paper relates to uncertain customer demands, decision making is performed using the robust approach based on worst case scenarios. The final results are evaluated by using the extra cost and the unmet demand against the deterministic approach to balance the decision making.
Minimax optimisation approach for the Robust Vehicle Routing Problem with Time Windows and uncertain travel times
International Journal of Logistics Systems and Management, 2011
This paper focuses on the Robust Vehicle Routing Problem with Time Windows (RVRPTW). The objectiv... more This paper focuses on the Robust Vehicle Routing Problem with Time Windows (RVRPTW). The objective is to find a robust solution that has the best worst-case performance This paper proposes a two-phase algorithm to solve a minimax optimisation problem with uncertain travel times. The algorithm includes the Modified Push-Forward Insertion Heuristic (MPFIH), a λ-interchange local search descent method and Tabu Search (TS). The experiments are based on a modified version of the Vehicle Routing Problem (VRP) with time windows benchmarking problem of Solomon. The results show that the two-phase algorithm can find robust solutions in all conditions.
The purpose of this paper is to update recent research of the fleet size and mix vehicle routing ... more The purpose of this paper is to update recent research of the fleet size and mix vehicle routing problem (FSMVRP), the heterogeneous fleet vehicle routing problem (HFVRP), and the extensions in a form of a literature review. In this paper, four major components of the problem: classification, considerable input data characteristics, decision making approaches, and heuristic and meta-heuristics algorithms are discussed. The comprehensive overview of the heterogeneous vehicle routing problem which puts a special emphasis on robustness approach is concluded and demonstrated in a simplified structure which has never been presented before. New potential research areas resulting from the survey are suggested in the final section. Full reference: Soonpracha K., A. Mungwattana, G.K. Janssens and T. Manisri (2014). Heterogeneous VRP review and conceptual framework. In: S. I. Ao and Oscar Castillo and Craig Douglas and David Dagan Feng and Jeong-A Lee (eds.), Proceedings of the International ...
INTERNATIONAL JOURNAL FOR TRAFFIC AND TRANSPORT ENGINEERING
This paper deals with the vehicle routing problem with time windows (VRPTW). The VRPTW routes a s... more This paper deals with the vehicle routing problem with time windows (VRPTW). The VRPTW routes a set of vehicles to service customers having two-sided time windows, i.e. earliest and latest start of service times. The demand requests are served by capacitated vehicles with limited travel times to return to the depot. The purpose of this paper is to develop a hybrid algorithm that uses the modified push forward insertion heuristic (MPFIH), a λ-interchange local search descent method (λ-LSD) and a genetic algorithm to solve the VRPTW with two objectives. The first objective aims to determine the minimum number of vehicles required and the second is to find the solution that minimizes the total travel time. A set of well-known benchmark problems are used to compare the quality of solutions. The results show that the proposed algorithm provides effective solutions compared with best found solutions and better than another heuristic used for comparison.
Handbook of Research on Artificial Intelligence Techniques and Algorithms, 2015
The vehicle routing problem requires mostly meta-heuristics to find approximate solutions. Conges... more The vehicle routing problem requires mostly meta-heuristics to find approximate solutions. Congestion makes it hard for planners to find good routes because travel times are uncertain. The problem is handled by building scenarios with a range of possible travel times to represent the uncertainty. The main goal is to find a robust solution, which performs "well" in bad scenarios. The experiments show that robust results are obtained in a computationally reasonable time, which means that the concept can be used by practitioners. Most applications are commercial, but also social applications exist. An earthquake or a flood might lead to road disruptions. Higher traffic delays appear due to lower speed on flooded roads or due to time spent on finding alternative routes. Routing like evacuation of wounded or delivery of food is hardly studied. The work is inspired by the 2011 flooding in Thailand.
Uploads
Papers by Tharinee Manisri