The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In traveling salesman problem, transportation cost is determined by not only distance, but also the cargo weight on the way. Influence of cargo weight on transportation cost is analyzed, and a weighted traveling salesman problem (WTSP) model is given. In WTSP model, cities with larger demands should have priority to be served for minimal cost. A discrete particle swarm optimization algorithm named...
A new hybrid particle swarm optimization (HPSO) algorithm which is based on particle swarm optimization algorithm and simulated annealing algorithm is proposed in this paper for solving multiple capacitated vehicle routing problem. The basic scheme consists in Particle swarm optimization with time-varying parameters and simulated annealing with memory and tempering features. Results from the computational...
This paper develops a multi-objective optimization model for the passenger train stopping scheme on high-speed railway lines. Minimizing the stopping times for all passenger trains, minimizing travel distance of empty trains and minimizing the number of transfer passengers are the three planning objectives of the model. For a given travel demand and specified capacity of stops, the model is solved...
Grain logistics vehicle routing problem is derived from vehicle routing problem, they have been a focus of research in the grain logistics managements recently, which the aim is to use the limited vehicles to a large number of jobs so that the maximum number of jobs can be completed with minimum cost. Aiming at the characteristics of the large batch and multi-point to multi-point transportation of...
The vehicle routing problem (VRP) is a well-known combinatorial optimization problem, holds a central place in logistics management. This paper proposes an hybrid particle swarm optimization (PSO) for VRP with reverse logistics, which possesses a new strategy to represent the solution of the problem, and in the evolution of PSO, SA algorithm is used to optimize the sequence of the customers served...
Sports scheduling has become an important area of applied operations research, since satisfying the fans and teams' requests and revenues of a sports league and TV networks may be affected by the quality of the league schedule. While this type of scheduling problem can be solved theoretically by mathematical methods, it computationally leads to hard problems. The traveling tournament problem (TTP)...
Particle swarm optimization combined with simulated annealing algorithm (PSOCSA) was an improved particle swarm optimization algorithm which introduced the simulated annealing (SA) strategy in particle swarm optimization (PSO). It was proposed to solve a mathematical model which is built for aircraft departure sequencing problem in this paper. The correlative implementation techniques and detailed...
Vehicle routing problem is a well-known NP problem, many heuristic algorithms, such as genetic algorithm, simulated annealing algorithm is applied in the problem. Particle swarm optimization (PSO) is a new evolutionary computation technique. Although PSO algorithm possesses many attractive properties, the method of encoding in NP problem need further to investigated. In the paper, a novel real number...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.