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.
The Workforce Scheduling and Routing Problem refers to the assignment of personnel to visits across various geographical locations. Solving this problem demands tackling scheduling and routing constraints while aiming to minimise the total operational cost. This paper presents a Genetic Algorithm (GA) tailored to tackle a set of real-world instances of this problem. The proposed GA uses a customised...
Quality of Service Multicast routing has been classified as an NP-Complete problem. As a consequence, multiple bio-inspired models have been implemented to solve it. Before implementing the bio-inspired models is necessary to select and encoding system. It denotes the way of representing the problem such that the bio-inspired models understand it and can be used to solve it. In this work we present...
Flexible job shop scheduling problem(s) (FJSP) were study and discussed in large amount. However, it is still far from a real-world manufacturing environment, in which disruptions such as machine failure must be taken into account. The goal of this paper is to create a genetic algorithm (GA) with very special chromosome encoding to handle FJSP that can adapt to disruption to reflect more closely the...
Aiming at the capacitated vehicle routing problem (CVRP) in the matter stream delivery field, an improved genetic algorithm (GA) based on local mutation operator is adopted. Two layers chromosome coding scheme is designed which can improve initial solutions. This coding method can insure that the sub-routing is effective to satiety the vehicle capacitated constraints. These improved measures have...
Based on the traditional theory and algorithms of vehicle routing problem, the multi-objective VRPSDP mathematical model is established in considering the minimum of the number of vehicles and the transportation costs. The genetic algorithm is used as the solving algorithm of the model in this paper, in order to ensure the effectiveness of the chromosomes in the iterative process, the chromosome encoding...
With the rapid development of electronic commerce and logistics distribution, multi-depot vehicle routing problem with time windows (MDVRPTW) as influencing electronic commerce more step development, has been paid more attentions. According to the characteristics of model, hybrid heuristic algorithm is used to get the optimization solution. First of all, use hybrid coding so as to simplify the problem,...
This paper presents a self-adaptive evolutionary network coding algorithm (SA-ENCA) that minimizes the resources of network coding while achieving the target throughput of multicast. The idea is to adaptively engage infeasible solutions as well in searching for better solutions. This is achieved by assigning fitness to the infeasible solutions by balancing corresponding objective function values against...
Existing routing methods are difficult to meet the requirements of real-time services. Generally, genetic routing algorithms may produce some paths of a network, but some of them really do not exist in the network. A routing computation method for IP networks based on genetic algorithm is proposed. It does not produce any path which does not exist actually in a network, so that it can shorten routing...
This study primarily focuses on solving the vehicle routing problem with soft time windows (VRPSTW) by applying an improved double-population genetic algorithm (DPGA). The traditional single-population genetic algorithm (SPGA) in solving vehicle routing problem usually traps in local optimum or consumes considerable time. In this paper two different initialization methods - random initialization method...
The design of distribution networks is one of the most important problems in supply chain and logistics management. The main elements in designing a distribution network are location and routing decisions. As these elements are interdependent in many distribution networks, the overall system cost can decrease if location and routing decisions are simultaneously tackled. In this paper, we consider...
A particular three-layer capacitated location-routing problem is investigated in which there exist two echelons of facilities to be located. A Lagrangian relaxation is used to separate the problem and obtain lower bound. Subgradient optimization is used to improve the lower bound and feedback information among the sub problems. Genetic algorithm and other heuristics are used to solve subproblems....
Multicast routing is very important for wireless sensor and actor networks (WSANs), where the decisions or control information from actors will be delivered to sensors over each link of the WSANs only once. In the multicast route each copy should be securely send to the authenticated destinations. The relay nodes should compute and identify forwarding paths to meet packet's security requirement. This...
In order to solve the problem of slow convergence speed of adaptive genetic algorithm (AGA) in the early stage of evolution, an improved adaptive genetic algorithm (IAGA) was presented. With the introduction of an indicator evaluating the degree of population diversity, the new algorithm can adaptively adjust the probabilities of crossover. Furthermore, the IAGA was applied to vehicle routing problem...
Location-routing problem (LRP) is a combinational optimization problem in a logistics system. Most heuristic methods employed for LRP is dividing the problem into location assignment and vehicle routing with a two-phase method, but this method often does not lead to a satisfactory result for the information can not be compressed from one phase to the other efficiently. In this paper we are concerned...
Routing of packets in networks requires that a path will be selected either dynamically while the packets are being forwarded, or statically (in advance) as in source routing from a source node to a destination. The genetic algorithms which has been applied to routing optimization problem is difficult because network is not a widely connectivity network. If we use traditional GA, it may generate some...
The vehicle routing problem of logistics distribution is indispensability contents in logistics distribution optimization. In order to satisfy with the individual and various demand of customer, establish single and mixed fleet multi-depot vehicle routing problem with backhauls model. According to the characteristics of model, hybrid genetic algorithm is used to get the optimization solution. First...
Open vehicle route problem of logistics distribution is the important step optimizing logistics distribution. According to the traditional genetic algorithm shortcomings of slowly convergent speed, weakly partial searching ability and easily premature, therefore, hybrid genetic algorithm is used to get the optimization solution, namely, use dualistic coding so as to simplify the problem and improve...
Real-time distributed multimedia applications have special requirements in terms of bandwidth, delay, delay jitter, etc. The current network, essentially being a connection-less network, provides only un-reliable, best-effort service. The data packets may follow different paths to the destination. The network resources, viz., switch buffer and link bandwidth, are fairly shared by packets from different...
Large-scale deployment of multicast applications is limited by the number of states that are set in routers for multicast groups. Aggregation is a natural solution to reducing the multicast forwarding states. In the way of sharing a common distribution tree among several groups, the approach to aggregated multicast reduces the number of forwarding states and improves network performance. Finding the...
To overcome the common defects of early convergence in the existing genetic algorithm, an improved genetic algorithm with new crossover operator and new crossover strategy was presented for the solution to the vehicle routing problem with soft time window (VRPTW). Experiments show that the improved genetic algorithm can dramatically reduce the number of same or similar chromosomes, and increase the...
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.