Improved genetic algorithm for minimum latency problem

Ban, Ha-Bang; Nghia, Nguyen Duc

doi:10.1145/1852611.1852614

Cited by 14 publications

(31 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Given an algorithm, OPT, Aver.Sol and Best.Sol are the optimal, average and best solution, respectively. The different between Best.Sol and Aver.Sol or UB is defined as follows: [3], [11], [12]. A. Salehipour et al only gave the average running time for Random dataset 3.…”

Section: B Results and Discussionmentioning

confidence: 99%

“…Recently, several meta-heuristic algorithms have been proposed in [3], [11], [12]. We propose a genetic algorithm in [3] for the MLP problem.…”

Section: Introductionmentioning

confidence: 99%

“…We propose a genetic algorithm in [3] for the MLP problem. The other meta-heuristic algorithms then are proposed by Salehipour et al [11], M. Silva et al [12].…”

Section: Introductionmentioning

confidence: 99%

“…The other meta-heuristic algorithms then are proposed by Salehipour et al [11], M. Silva et al [12]. The experimental results in [3] [11], [12] also indicate that the meta-heuristic approach is suitable to solve the MLP problem. The algorithms in [11], [12] are mainly based on the principles of Variable Neighborhood Search (VNS) in order to find better solution.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A meta-heuristic algorithm combining between Tabu and Variable Neighborhood Search for the Minimum Latency Problem

Ban

Duc

2013

The 2013 RIVF International Conference on Computing &Amp; Communication Technologies - Research, Innovation, and Vision for Fut

View full text Add to dashboard Cite

Minimum Latency Problem (MLP) is a class of NP-hard combinatorial optimization problems which has many practical applications. In this paper, we propose a meta-heuristic algorithm which combines Tabu search (TS) and Variable Neighborhood Search (VNS) for the MLP. In the proposed algorithm, the TS is used to prevent the search from getting trapped into cycles, and guide the VNS to escape local optima. In a cooperative way, the VNS is employed to generate diverse neighborhoods for the TS. We introduce a novel neighborhoods' structure for the VNS, and indicate a sequential order to explore these neighborhoods such that the VNS can give best solutions. In order to reduce the time complexity of neighborhood search, we also propose a constant time algorithm for calculating the latency cost of each neighboring solution. Extensive numerical experiments and comparisons with best meta-heuristic algorithms proposed in the literature show that the proposed algorithm is highly competitive, providing new best solutions for some instances.

show abstract

Section: B Results and Discussionmentioning

confidence: 99%

“…Recently, several meta-heuristic algorithms have been proposed in [3], [11], [12]. We propose a genetic algorithm in [3] for the MLP problem.…”

Section: Introductionmentioning

confidence: 99%

“…We propose a genetic algorithm in [3] for the MLP problem. The other meta-heuristic algorithms then are proposed by Salehipour et al [11], M. Silva et al [12].…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A meta-heuristic algorithm combining between Tabu and Variable Neighborhood Search for the Minimum Latency Problem

Ban

Duc

2013

The 2013 RIVF International Conference on Computing &Amp; Communication Technologies - Research, Innovation, and Vision for Fut

View full text Add to dashboard Cite

show abstract

“…The Traveling Repairman Problem (TRP) or Minimum Latency Problem (MLP) has been studied in a number of previous work [1,2,3,4,5,6,7,8,9,14]. It has arised many practical applications, e.g., whenever repairman or servers have to accommodate a set of requests so as to minimize their total (or average) waiting time [1,8,14].…”

Section: Introductionmentioning

confidence: 99%

A GRASP+VND Algorithm for the Multiple Traveling Repairman Problem with Distance Constraints

Ban

2018

JCC

Self Cite

View full text Add to dashboard Cite

Abstract. Multiple Traveling Repairmen Problem (MTRP) is a class of NP-hard combinatorial optimization problems. In this paper, an other variant of MTRP, also known as Multiple Traveling Repairmen Problem with Distance Constraint (MTRPD), is introduced. In MTRPD problem, a fleet of vehicles serves a set of customers. Each vehicle which starts from the depot is not allowed to travel any distance longer than a limit and each customer must be visited exactly once. The goal is to find the order of customer visits of all vehicles that minimizes the sum of all vertices' waiting time. To the best of our knowledge, the problem has not been studied much previously, even though it is a natural and practical extension of the Traveling Repairman Problem or Multiple Traveling Repairmen Problem case. In our work, we propose a metaheuristic algorithm which is mainly based on the principles of Greedy Randomized Adaptive Search Procedure (GRASP) and Variable Neighborhood Descent (VND) to solve the problem. The GRASP is used to build an initial solution which is good enough in a construction phase. In a cooperative way, the VND is employed to generate diverse neighborhoods in an improvement phase, therefore, it can help the search escape from local optimal. Extensive numerical experiments on 321 benchmark instances show that our algorithm can find the optimal solutions with up to 50 vertices in several instances. For larger instances, our algorithm obtains provably near-optimal solutions, even for large instances.

show abstract

A RVND+ILS Metaheuristic to Solve the Delivery Man Problem with Time Windows

Ban

2019

Computational Data and Social Networks

View full text Add to dashboard Cite

Improved genetic algorithm for minimum latency problem

Cited by 14 publications

References 11 publications

A meta-heuristic algorithm combining between Tabu and Variable Neighborhood Search for the Minimum Latency Problem

A meta-heuristic algorithm combining between Tabu and Variable Neighborhood Search for the Minimum Latency Problem

A GRASP+VND Algorithm for the Multiple Traveling Repairman Problem with Distance Constraints

A RVND+ILS Metaheuristic to Solve the Delivery Man Problem with Time Windows

Contact Info

Product

Resources

About