Optimizing the vehicle routing problem with time windows: A discrete particle swarm optimization approach

YJ Gong, J Zhang, O Liu, RZ Huang… - … on Systems, Man …, 2011 - ieeexplore.ieee.org
Vehicle routing problem with time windows (VRPTW) is a well-known NP-hard combinatorial
optimization problem that is crucial for transportation and logistics systems. Even though the …
被引用次数：230 相关文章

Optimizing the vehicle routing problem with time windows: A discrete particle swarm optimization approach

YJ Gong, J Zhang, O Liu, RZ Huang… - … on Systems, Man …, 2012 - scholar.xjtlu.edu.cn
Vehicle routing problem with time windows (VRPTW) is a well-known NP-hard combinatorial
optimization problem that is crucial for transportation and logistics systems. Even though the …
[PDF] researchgate.net

[PDF][PDF] Optimizing the Vehicle Routing Problem With Time Windows: A Discrete Particle Swarm Optimization Approach

YJ Gong, J Zhang, O Liu, RZ Huang… - … ON SYSTEMS, MAN …, 2012 - researchgate.net
(VRPTW) is a well-known NP-hard combinatorial optimization problem that is crucial for
transportation and logistics systems. Even though the particle swarm optimization (PSO) …

Optimizing the Vehicle Routing Problem With Time Windows: A Discrete Particle Swarm Optimization Approach

YJ Gong, J Zhang, O Liu, RZ Huang… - IEEE Transactions on …, 2012 - dl.acm.org
Vehicle routing problem with time windows (VRPTW) is a well-known NP-hard combinatorial
optimization problem that is crucial for transportation and logistics systems. Even though the …

Optimizing the vehicle routing problem with time windows: A discrete particle swarm optimization approach

YJ Gong, J Zhang, O Liu, RZ Huang… - … on Systems, Man …, 2012 - scholars.cityu.edu.hk
Vehicle routing problem with time windows (VRPTW) is a well-known NP-hard combinatorial
optimization problem that is crucial for transportation and logistics systems. Even though the …

Optimizing the vehicle routing problem with time windows: A discrete particle swarm optimization approach

YJ Gong, J Zhang, O Liu, RZ Huang… - … on Systems, Man …, 2012 - research.aston.ac.uk
Vehicle routing problem with time windows (VRPTW) is a well-known NP-hard combinatorial
optimization problem that is crucial for transportation and logistics systems. Even though the …

Optimizing the Vehicle Routing Problem With Time Windows: A Discrete Particle Swarm Optimization Approach

YJ Gong, J Zhang, O Liu, RZ Huang… - IEEE Transactions on …, 2012 - infona.pl
Vehicle routing problem with time windows (VRPTW) is a well-known NP-hard combinatorial
optimization problem that is crucial for transportation and logistics systems. Even though the …

Optimizing the Vehicle Routing Problem With Time Windows: A Discrete Particle Swarm Optimization Approach

YJ Gong, J Zhang, O Liu, RZ Huang… - … on Systems, Man …, 2012 - scholarworks.bwise.kr
Vehicle routing problem with time windows (VRPTW) is a well-known NP-hard combinatorial
optimization problem that is crucial for transportation and logistics systems. Even though the …

[引用][C] Optimizing the Vehicle Routing Problem With Time Windows: A Discrete Particle Swarm Optimization Approach

YJ GONG, JUN ZHANG, OU LIU… - … on systems, man …, 2012 - pascal-francis.inist.fr
Optimizing the Vehicle Routing Problem With Time Windows: A Discrete Particle Swarm
Optimization Approach CNRS Inist Pascal-Francis CNRS Pascal and Francis Bibliographic …

Optimizing the Vehicle Routing Problem With Time Windows: A Discrete Particle Swarm Optimization Approach

YJ Gong, J Zhang, O Liu, RZ Huang… - IEEE Transactions on …, 2012 - infona.pl
Vehicle routing problem with time windows (VRPTW) is a well-known NP-hard combinatorial
optimization problem that is crucial for transportation and logistics systems. Even though the …