Mixed Transportation Network Design Based on Immune Clone Annealing Algorithm

Hard-to-access health infrastructure is likely to lead to increased morbidity and mortality. The optimal layout of health facilities is significant for disease control and prevention. This study aims to propose a method to provide equitable access to capacitated preventive health facilities, which captures the key features of the effect of congestion in a competitive choice environment. The problem is formulated as a bilevel nonlinear integer programming model. The upper level is a biobjective programming model subject to investment budget (B) constraint, and the lower level is a user equilibrium analogous model resulting from the users’ choice of facility location. An efficient and operable heuristic algorithm was designed according to the bilevel decision structure where a genetic algorithm (GA) with elite strategy is developed to solve the upper-level problem and the method of successive averages (MSA) is adopted to solve the lower-level problem. A case study is employed to validate the performance of the proposed method. The results show that the method is robust and could reach an equal service quality in a reasonable computation time. However, the sensitivity analysis indicated that the marginal benefit of the investment decreased. There is an optimal B beyond which further increments in investment would not offset the benefits. In addition, the proposed method could be beneficial for other congested public service facilities that users are free to choose from.

Aiming at affecting of the parameter selection method of support vector machine(SVM) on its application in blind equalization algorithm, a SVM constant modulus blind equalization algorithm based on immune clone selection algorithm(CSA-SVM-CMA) is proposed. In this proposed algorithm, the immune clone algorithm is used to optimize the parameters of the SVM on the basis advantages of its preventing evolutionary precocious, avoiding local optimum, and fast convergence. The proposed algorithm can improve the parameter selection efficiency of SVM constant modulus blind equalization algorithm(SVM-CMA) and overcome the defect of the artificial setting parameters. Accordingly, the CSA-SVM-CMA has faster convergence rate and smaller mean square error than the SVM-CMA. Computer simulations in underwater acoustic channels have proved the validity of the algorithm.

By handling the travel cost function artfully, the authors formulate the transportation mixed network design problem (MNDP) as a mixed-integer, nonlinear bilevel programming problem, in which the lower-level problem, comparing with that of conventional bilevel DNDP models, is not a side constrained user equilibrium assignment problem, but a standard user equilibrium assignment problem. Then, the bilevel programming model for MNDP is reformulated as a continuous version of bilevel programming problem by the continuation method. By virtue of the optimal-value function, the lower-level assignment problem can be expressed as a nonlinear equality constraint. Therefore, the bilevel programming model for MNDP can be transformed into an equivalent single-level optimization problem. By exploring the inherent nature of the MNDP, the optimal-value function for the lower-level equilibrium assignment problem is proved to be continuously differentiable and its functional value and gradient can be obtained efficiently. Thus, a continuously differentiable but still nonconvex optimization formulation of the MNDP is created, and then a locally convergent algorithm is proposed by applying penalty function method. The inner loop of solving the subproblem is mainly to implement an all-or-nothing assignment. Finally, a small-scale transportation network and a large-scale network are presented to verify the proposed model and algorithm.

As the poor applicability of rail transit and elevated road limited by economy, population and many other factors, the waste of road resources caused by bus lane, maximizing application of available road resources and bus facilities, reducing the environmental pollution is the critical issue faced by current situation of urban transportation development in China. Guided by Bus Priority Oriented, utilized comprehensive techniques, such as ABC classification, bi-level programming model, sensitivity analysis, this paper constructed a theoretical frame of elastic equilibrium based on system optimization. Taking time and environment as optimized objectives, This paper established the Bi-Level multiobjective programming model based on travel time, and programmed with MATLAB for the calculation. Finally, the case study is illustrated. the software VISSIM was adopted to realize the simulation of the volume before and after the implementation of elastic plan in urban areas of PingDingshan. The simulation results showed the validity and feasibility of the modeling and simulation of Bus Priority Oriented urban road network elastic equilibrium.

Research on an Optimization Model for Transportation Network Design

Although a wide range of literature has investigated the network-level highway maintenance plans and policies, few of them focused on the maintenance scheduling problem. This study proposes a methodology framework to model and compare two different maintenance scheduling strategies for highway networks, i.e., minimal makespan strategy (MMS) and minimal increased travel delay strategy (MITDS). We formulate MMS as a mixed integer linear programming model subject to the constraints of the quantity of manpower and the worst-first maintenance sequence. A bi-level programming model is proposed to quantify and optimize MITDS. The upper level model determines the optimal scheduling to minimize the increased traffic delays during the maintenance makespan. In the lower level, a modified day-to-day traffic assignment model is put forward to reflect the traffic evolution dynamics by simulating travelers’ route choice behaviors. A simulated annealing algorithm and augmented Lagrange algorithm are employed to solve the two proposed models, respectively. Finally, a numerical example using a highway network is developed. The two proposed strategies are tested considering different traffic demands, numbers of engineering teams, and travelers’ sensitivities to traffic congestion. The experiment results reveal that compared with MMS, MITDS extends makespan by 2 days though, it reduces the total increased travel delays by 4% and both MMS and MITDS can obtain the minimum total increased travel delays when the number of engineering teams is 6. The sensitivity analysis indicates that both the two strategies have the maximum and minimum total increased travel delays when the weight of prediction in travelers’ perception is 0.3 and 0.7, respectively. The proposed framework has the potential to provide reference in implementing highway maintenance activities reasonably.

Both empty and heavy car flows should be taken into consideration in the study of the Optimization Model of Car Flow Organization, in the Loading End of Heavy Haul Railway. Firstly, through the analysis of empty and heavy car flow organization in the semi-closed heavy haul railway loading end, comprehensive optimization model based on ability of station and railway can be established in order to obtain car flow organization scheme with minimum residence time of both empty and heavy cars in the loading end. Secondly, immune clone algorithm is applied to solve the model in which the objective function is regarded as antibody and the constrained condition is considered as antigen to calculate the affinity, further to conduct the mutation, based on information entropy. Mutation is conducted according to the affinity. In the solving process, reproduction can be realized with the use of immune clone selection algorithm. Besides, premature convergence can be prevented by using the antibody concentration which can control the population size. Finally, simulation results show that the average search time of the proposed algorithm is reduced by 36 and 51% respectively compared with the GA and PSO.

A bi-level programming model is used to describe the continuous equilibrium network design problem in this paper. Traffic demand and supply that are both random are described to be, respectively, truncated normal distribution and logarithmic normal distribution. At the upper level model, the optimization objective is to minimize the mean of total impedance of network system and enhancement of road capacity as decision-making variables. The constrained condition is investment budget. The lower level program is formulated as a user equilibrium traffic assignment model, which link flow defined as the decision-making variable. Above all, a Monte Carlo simulation-based genetic algorithm was provided to solve the bi-level model and a satisfied result on the calculation and analysis of a small tested road network can be had.

A kind of effective feature model of palm BIS data is presented according to the features of Palm bio-impedance spectroscopy (BIS) data. Based on immune clone algorithm and least squares method, an improved palm BIS feature selection algorithm is established,which can be applied to obtain the optimal feature subset that can be completely represented the palm BIS data, Finally, the algorithm is compared with other algorithms. The experimental results show that the accuracy of the feature subset obtained by the algorithm has reached 93.2 in SVM classification algorithm test.Therefore, the algorithm in this article is valid and reliable , which is of high theoretical and practical value. Full Text: PDF DOI: http://dx.doi.org/10.11591/telkomnika.v16i2.8965

Purpose – Commonly shared logistics services help manufacturing companies to cut down redundant logistics investments while enhance the overall service quality. Such service-sharing mode has been naturally adopted by group companies to form the so-called headquarter-managed centralized distribution center (HQ-CDC). The HQ-CDC manages the common inventories for the group’s subsidiaries and provides shared storage services to the subsidiaries through appropriate sizing, pricing and common replenishment. Apart from seeking a global optimal solution for the whole group, the purpose of this paper is to investigate balanced solutions between the HQ-CDC and the subsidiaries. Design/methodology/approach – Two decision models are formulated. Integrated model where the group company makes all-in-one decision to determine the space allocation, price setting and the material replenishment on behalf of HQ-CDC and subsidiaries. Bilevel programming model where HQ-CDC and subsidiaries make decisions sequentially to draw a balance between their local objectives. From the perspective of result analysis, the integrated model will develop a managerial benchmark which minimizes the group company’s total cost, while the bilevel programming model could be used to measure the interactive effects between local objectives as well as their final effect on the total objective. Findings – Through comparing the numerical results of the two models, two major findings are obtained. First, the HQ-CDC’s profit is noticeably improved in the bilevel programming model as compared to the integrated model. However, the improvement of HQ-CDC’s profit triggers the cost increasing of subsidiaries. Second, the analyses of different sizing and pricing policies reveal that the implementation of the leased space leads to a more flexible space utilization in the HQ-CDC and the reduced group company’s total cost especially in face of large demand and high demand fluctuation. Research limitations/implications – Several classical game-based decision models are to be introduced to examine the more complex relationships between the HQ-CDC and the subsidiaries, such as Nash Game model or Stackelberg Game model, and more complete and meaningful managerial implications may be found through result comparison with the integrated model. The analytical solutions may be developed to achieve more accurate results, but the mathematical models may have to be with easier structure or tighter assumptions. Practical implications – The group company should take a comprehensive consideration on both cost and profit before choosing the decision framework and the coordination strategy. HQ-CDC prefers a more flexible space usage strategy to avoid idle space and to increase the space utilization. The subsidiaries with high demand uncertainties should burden a part of cost to induce the subsidiaries with steady demands to coordinate. Tanshipments should be encouraged in HQ-CDC to reduce the aggregate inventory level as well as to maintain the customer service level. Social implications – The proposed decision frameworks and warehousing policies provide guidance for the managers in group companies to choose the proper policy and for the subsidiaries to better coordinate. Originality/value – This research studies the services sharing on the warehouse sizing, pricing and common replenishment in a HQ-CDC. The interactive decisions between the HQ-CDC and the subsidiaries are formulated in a bilevel programming model and then analyzed under various practical scenarios.

Optimization of Two-Stage Port Logistics Network of Dynamic Hinterland Based on Bi-level Programming Model

There is a high interest in optimization of transportation and logistics networks due to its high impact on the economic performance of supply chain networks. This paper presents a bilevel mixed-integer programming model as well as a solution method to manage distribution process in a logistic network, where two decision makers, called distributor and interdictor, make efforts to achieve their contradictory targets. This problem, known as arc interdiction location-routing problem (AI-LRP), is in fact a new, extended version of the classical LRP. The distributor strives to deliver goods to customers with minimal risk and cost, while the interdictor, by contrast, endeavors to disrupt products flow through a few critical arcs. AI-LRP has wide applications in reality, including distribution of particular goods like money, precious metals, hazardous materials, and prisoners that may need security measures. The interplay between two decision makers is formulated as a bilevel model. To solve the model, a novel genetic algorithm (NGA) is devised in which the density ordered heuristic of the knapsack problem is applied to generate an initial population of solutions. Computational results illustrate that NGA outperforms a commercial solver in terms of computational time and quality of solutions.

Starts from the analysis of the different levels of service constraints impact to the network design, this paper combines the indicators in the levels of network service and road service, and then builds the bi-level programming model of road network design based on the level of service. And the paper solves the bi-level programming model based on the simulated annealing to verify that the saturation constraint values of the level of link service can be relaxed under the premise of ensuring the overall level of network service, by which road resources are be used fully with little impact of the road network.

<p style='text-indent:20px;'><i>Seru</i> production is one of the latest manufacturing modes arising from Japanese production practice. <i>Seru</i> can achieve efficiency, flexibility, and responsiveness simultaneously. To accommodate the current business environment with volatile demands and fierce competitions, <i>seru</i> has attracted more and more attention both from researchers and practitioners. A new planning management system, just-in-time organization system (JIT-OS), is used to manage and control a <i>seru</i> production system. The JIT-OS contains two decisions: <i>seru</i> formation and <i>seru</i> loading. By <i>seru</i> formation, a <i>seru</i> system with one or multiple appropriate <i>serus</i> is configured; by <i>seru</i> loading, customer ordered products are allocated to <i>serus</i> to implement production plans. In the process of <i>seru</i> formation, workers have to be assigned to <i>serus</i>. In this paper, a <i>seru</i> loading problem with worker assignment is constructed as a bi-level programming model, and the worker assignment on the upper level is to minimize total idle time while the lower level is to minimize the makespan by finding out optimal product allocation. A product lot can be splitted and allocated to different <i>serus</i>. The problem of this paper is shown to be NP-hard. Therefore, a simulated annealing and genetic algorithm (SA-GA) is developed. The SA is for the upper level programming and the GA is for the lower level programming. The practicality and effectiveness of the model and algorithm are verified by two numerical examples, and the results show that the SA-GA algorithm has good scalability.

A new multi-objective bi-level programming model for energy and locality aware multi-job scheduling in cloud computing