Wyniki wyszukiwania dla: Xingye Dong

Pozycje od 1 do 12 spośród 12 wyników

rozdział

Study on split delivery open vehicle routing problem within two splits

Ping Chen, Xingye Dong, Jianhua Xiao

2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD) > 724 - 728

2016 12th International Conference on Natural Computation and 13th Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)

Open vehicle routing problem (OVRP) is considered as a variant of vehicle routing problem (VRP), which has two hierarchical objectives, i.e., to minimize the number of routes, and to minimize the total cost measured by travel distances. Since the split delivery vehicle routing problem (SDVRP) has been studied extensively, and demonstrated that it can reduce the cost by at most 50% by allowing to split...

rozdział

A More Effective Constructive Algorithm for Permutation Flowshop Problem

Xingye Dong, Houkuan Huang, Ping Chen

Lecture Notes in Computer Science > Intelligent Data Engineering and Automated Learning – IDEAL 2006 > Learning and Information Processing > 25-32

NEH (Nawaz et al., 1983) is an effective heuristic for solving the permutation flowshop problem with the objective of makespan. It includes two phases. PE-VM (Li et al., 2004), which is based on NEH, is analyzed and we conclude that its good performance is partially due to the priority rule it used in phase I. Then, we propose a new measure to solve job insertion ties which may arise in phase II....

rozdział

GTrust: A Distributed Trust Model in Multi-Agent Systems Based on Grey System Theory

Lijian He, Houkuan Huang, Xingye Dong

Lecture Notes in Computer Science > Rough Sets and Knowledge Technology > Knowledge Technology > 274-279

Trust model is a key problem in Multi-Agent System. In this paper, a distributed trust model called GTrust is constructed to help agents choose partners in their interactions. The grey system theory, which is used to deal with uncertainty problems, is introduced into this model. A method is designed to rate the witness and also a grey fixed weight clustering approach is proposed to determine the trust...

rozdział

Study on Iterated Local Search Algorithm for Permutation Flowshop Problem with Total Flowtime Objective

Xingye Dong, Houkuan Huang, Ping Chen

Communications in Computer and Information Science > Applied Informatics and Communication > Intelligent Control and System > 236-245

Iterated Local Search (ILS) is a simple and efficient algorithm, which has been used to solve many combinatorial optimization problems. However, the effect of different search sequences in the local search procedure has not been studied. In this work, we used the ILS algorithm to solve the permutation flowshop scheduling problem with total flowtime objective, and observe the effect of different search...

artykuł

Self-adaptive perturbation and multi-neighborhood search for iterated local search on the permutation flow shop problem

Xingye Dong, Maciek Nowak, Ping Chen, Youfang Lin

Computers & Industrial Engineering > 2015 > 87 > C > 176-185

The flow shop scheduling problem minimizing total flow time is a famous combinatorial optimization problem. Among the many algorithms proposed to solve this problem, iterated local search (ILS) is a simple, effective and efficient one. Research shows that the perturbation method and neighborhood structure play key roles in the performance of ILS. However, existing ILS lacks the self-adaptive ability...

rozdział

A self-adaptive iterated local search algorithm on the permutation flow shop scheduling problem

Xingye Dong, Maciek Nowak, Ping Chen, Youfang Lin

2014 11th International Conference on Informatics in Control, Automation and Robotics (ICINCO) > 1 > 378 - 384

2014 11th International Conference on Informatics in Control, Automation and Robotics (ICINCO)

Iterated local search (ILS) is a simple, effective and efficient metaheuristic, displaying strong performance on the permutation flow shop scheduling problem minimizing total flow time. Its perturbation method plays an important role in practice. However, in ILS, current methodology does not use an evaluation of the search status to adjust the perturbation strength. In this work, a method is proposed...

artykuł

A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time

Xingye Dong, Ping Chen, Houkuan Huang, Maciek Nowak

Computers and Operations Research > 2013 > 40 > 2 > 627-632

A variety of metaheuristics have been developed to solve the permutation flow shop problem minimizing total flow time. Iterated local search (ILS) is a simple but powerful metaheuristic used to solve this problem. Fundamentally, ILS is a procedure that needs to be restarted from another solution when it is trapped in a local optimum. A new solution is often generated by only slightly perturbing the...

rozdział

Study on heuristics for the permutation flowshop with sequence dependent setup times

Xingye Dong, Houkuan Huang, Ping Chen

2009 IEEE International Conference on Information Reuse&Integration > 417 - 421

2009 IEEE International Conference on Information Reuse & Integration (IRI 2009)

It is studied that several constructive heuristics for solving the sequence dependent setup time flowshop problem with the objective of minimizing makespan. Three priority rules imbedded in the heuristics are tested and a tie-breaking strategy is examined. The experimental results on benchmarks show that the priority rules are helpful to improve the performance, especially for the instances in which...

artykuł

An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion

Xingye Dong, Houkuan Huang, Ping Chen

Computers and Operations Research > 2009 > 36 > 5 > 1664-1669

An ILS algorithm is proposed to solve the permutation flowshop sequencing problem with total flowtime criterion. The effects of different initial permutations and different perturbation strengths are studied. Comparisons are carried out with three constructive heuristics, three ant-colony algorithms and a particle swarm optimization algorithm. Experiments on benchmarks and a set of random instances...

rozdział

A New Hybrid Iterated Local Search for the Open Vehicle Routing Problem

Ping Chen, Youli Qu, Houkuan Huang, Xingye Dong

2008 IEEE Pacific-Asia Workshop on Computational Intelligence and Industrial Application > 1 > 891 - 895

2008 Pacific-Asia Workshop on Computational Intelligence and Industrial Application. PACIIA 2008

Open vehicle routing problem (OVRP) aims to design a set of open vehicle routes with the least number of vehicles and the shortest total travel time, for serving a set of geographically distributed customers with known coordinates and demands. In this paper, a new hybrid iterated local search algorithm IVND is proposed for solving the OVRP. The IVND integrates a variable neighborhood descent (VND)...

artykuł

An improved NEH-based heuristic for the permutation flowshop problem

Xingye Dong, Houkuan Huang, Ping Chen

Computers and Operations Research > 2008 > 35 > 12 > 3962-3968

NEH is an effective heuristic for solving the permutation flowshop problem with the objective of makespan. It includes two phases: generate an initial sequence and then construct a solution. The initial sequence is studied and a strategy is proposed to solve job insertion ties which may arise in the construct process. The initial sequence which is generated by combining the average processing time...

rozdział

An Ant Colony System Based Heuristic Algorithm for the Vehicle Routing Problem with Simultaneous Delivery and Pickup

Ping Chen, Houkuan Huang, Xingye Dong

2007 2nd IEEE Conference on Industrial Electronics and Applications > 136 - 141

2007 Second IEEE Conference on Industrial Electronics and Applications

The vehicle routing problem with simultaneous delivery and pickup(VRPSDP) is a general variant of Vehicle Routing Problem(VRP). Although there is a vast literature related to the VRP, little is dealing with the VRPSDP. In this paper, we propose a heuristic algorithm for solving the VRPSDP, based on the Ant Colony System(ACS). In our algorithm, the classical construction phase of the ACS is replaced...

Opcje filtrowania

Data publikacji

Ustaw własny zakres dat

INFONA - portal komunikacji naukowej

Wyniki wyszukiwania dla: Xingye Dong

Study on split delivery open vehicle routing problem within two splits

A More Effective Constructive Algorithm for Permutation Flowshop Problem

GTrust: A Distributed Trust Model in Multi-Agent Systems Based on Grey System Theory

Study on Iterated Local Search Algorithm for Permutation Flowshop Problem with Total Flowtime Objective

Self-adaptive perturbation and multi-neighborhood search for iterated local search on the permutation flow shop problem

A self-adaptive iterated local search algorithm on the permutation flow shop scheduling problem

A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time

Study on heuristics for the permutation flowshop with sequence dependent setup times

An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion

A New Hybrid Iterated Local Search for the Open Vehicle Routing Problem

An improved NEH-based heuristic for the permutation flowshop problem

An Ant Colony System Based Heuristic Algorithm for the Vehicle Routing Problem with Simultaneous Delivery and Pickup

Opcje filtrowania

Data publikacji

Typ publikacji

Słowa kluczowe

Zbiór danych

Czasopismo

INFONA - portal komunikacji naukowej

Wyniki wyszukiwania dla: Xingye Dong

Dodaj adresata

Anulowanie wysłania wiadomości

Czy na pewno chcesz anulować wysłanie wiadomości?

Wyślij wiadomość

Opcje filtrowania

Data publikacji

Ustawianie zakresu dat

Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.

Typ publikacji

Słowa kluczowe

Zbiór danych

Czasopismo

Zgłaszanie błędu / nadużycia

Nieudane wysłanie zgłoszenia

Ułatwienia dostępu