This document describes a study that compares swarm-based algorithms (particle swarm optimization and glowworm swarm optimization) for solving a stochastic optimization problem in container terminal design. The goal is to minimize total container passage time by determining the optimal number of equipment (e.g. cranes, trucks) needed considering uncertainties like demand variations. A simulation model using Monte Carlo methods captures the stochastic nature. Results show the proposed glowworm swarm optimization approach performs better than particle swarm optimization algorithms in finding feasible solutions to the complex optimization problem involving numerous combinations of decisions under uncertainty.
This document describes a study that uses discrete event simulation combined with multi-criteria decision analysis to help plan the logistics system of a new steel plant in Brazil. The study evaluates different configurations for the size of the plant's private iron ore vessel fleet and storage capacities. Ten scenarios are simulated and evaluated based on criteria like plant stoppages and investment costs. The results help determine the best fleet size and storage capacities to avoid interruptions in steel production.
Topological Optimization and Genetic Algorithms Used in a Wheel Project for a...Neimar Silva
This document summarizes a study that used topological optimization and genetic algorithms to analyze and optimize the design of wheels for an unmanned aerial vehicle (UAV). The study used finite element analysis software to conduct topological optimization on a simplified 2D model of a wheel. The goal was to reduce the wheel's mass by 50% while maintaining structural integrity. Genetic algorithms from other optimization software were also utilized. The optimized wheel design reduced mass by 40% compared to previous designs. The study found that wheel width had the greatest influence on the aircraft's mechanical performance.
A transportation scheduling management system using decision tree and iterate...IJECEIAES
This paper aimed to develop a delivery truck scheduling management system using a decision tree to support decision-making in selecting a delivery truck. First-in-first-out (FIFO) and decision tree techniques were applied to prioritize loading doors for delivery trucks with the use of iterated local search (ILS) in recommending the route for the transport of goods. Besides, an arrangement of loading doors can be assigned to the door that meets the specified conditions. The experimental results showed that the system was able to assign the job to a delivery truck under the specified conditions that were close to the actual operation at a similarity of 0.80. In addition, the application of ILS suggested the route of the food delivery truck in planning the most effective transportation route with the best total distance.
This document describes a study that uses discrete event simulation (DES) and multi-criteria decision analysis (MCDA) to model and evaluate configurations for a closed-loop maritime transportation system that supplies raw materials to a steel plant. The system transports iron ore from mines to the plant via a fleet of vessels. Ten simulation scenarios that vary fleet size, storage capacities, and iron ore sourcing were evaluated. Key criteria like plant stoppages, costs, and inventory levels were used to score the scenarios. The results aim to help decision makers identify the best configuration for the transportation system.
This paper evokes the vehicle routing problem (VRP) which aims to determine the minimum total cost
pathways for a fleet of heterogeneous vehicles to deliver a set of customers' orders. The inability of
optimization algorithms alone to fully satisfy the needs of logistic managers become obvious in
transportation field due to the spatial nature of such problems. In this context, we couple a geographical
information system (GIS) with a metaheuristic to handle the VRP efficiently then generate a geographical
solution instead of the numerical solution. A real-case instance in a Tunisian region is studied in order to
test the proposed approach.
Time-Cost Trade-Off Analysis in a Construction Project Problem: Case Studyijceronline
In construction project, cost and time reduction is crucial in today’s competitive market respect. Cost and time along with quality of the project play vital role in construction project’s decision. Reduction in cost and time of projects has increased the demand of construction project in the recent years. Trade-off between different conflicting aspects of projects is one of the challenging problems often faced by construction companies. Time, cost and quality of project delivery are the important aspects of each project which lead researchers in developing time-cost trade-off model. These models are serving as important management tool for overcoming the limitation of critical path methods frequently used by company. The objective of time-cost trade-off analysis is to reduce the original project duration with possible least total cost. In this paper critical path method with a heuristic method is used to find out the crash durations and crash costs. A regression analysis is performed to identify the relationship between the times and costs in order to formulize an optimization problem model. The problem is then solved by Matlab program which yields a least cost of $60937 with duration 129.50 ≈130 days. Applying this approach, the result obtained is satisfactory, which is an indication of usefulness of this approach in construction project problems.
HOPX Crossover Operator for the Fixed Charge Logistic Model with Priority Bas...IJECEIAES
In this paper, we are interested to an important Logistic problem modelised us optimization problem. It is the fixed charge transportation problem (FCTP) where the aim is to find the optimal solution which minimizes the objective function containig two costs, variable costs proportional to the amount shipped and fixed cost regardless of the quantity transported. To solve this kind of problem, metaheuristics and evolutionary methods should be applied. Genetic algorithms (GAs) seem to be one of such hopeful approaches which is based both on probability operators (Crossover and mutation) responsible for widen the solution space. The different characteristics of those operators influence on the performance and the quality of the genetic algorithm. In order to improve the performance of the GA to solve the FCTP, we propose a new adapted crossover operator called HOPX with the priority-based encoding by hybridizing the characteristics of the two most performent operators, the Order Crossover (OX) and Positionbased crossover (PX). Numerical results are presented and discussed for several instances showing the performance of the developed approach to obtain optimal solution in reduced time in comparison to GAs with other crossover operators.
Strategic Management in Dynamic Environments MGMT 690Beginning D.docxflorriezhamphrey3065
Strategic Management in Dynamic Environments MGMT 690
Beginning Development of Global Strategies
3-4 Pages
Mike, one of the marketing strategists on your team, stops at your office door wanting to talk. “We use fabrics that are made domestically; however, there are issues with using these same fabrics globally. There are laws and regulations that prevent us from shipping these fabrics to other countries. This is a huge concern. One of our primary selling points is the consistency of quality of our product.”
You confirm Mike’s concern, “That’s an excellent point,” you say. “Now you’ve just given yourself and our team more work for the presentation. I’m sure that will come up. One of the board members used to run a textile plant in China.”
Mike nods his head in agreement. “I imagine textiles will not be the only resource concern,” he says.
Consider the following in your response:
· Why should resources be a concern in a global strategy?
· What resources may be a concern in the country you selected?
· How will this impact the decision to move to the country that you selected?
· How will this impact your competitive strategy in your global market?
MUST USE ACADEMIC SOURCES SUCH AS GOOGLE SCHOLAR, GOVERNMENT, SCHOLARLY REVIEWED ETC.
European Journal of Operational Research 241 (2015) 502–512
Contents lists available at ScienceDirect
European Journal of Operational Research
journal homepage: www.elsevier.com/locate/ejor
Innovative Applications of O.R.
Solving air traffic conflict problems via local continuous optimization
Clément Peyronne a,∗, Andrew R. Conn b, Marcel Mongeau c,d, Daniel Delahaye c,d
a Capgemini, 15 av. du Dr Maurice Grynfogel, 31000 Toulouse, France
b IBM, T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, USA
c ENAC, MAIAA, F-31055 Toulouse, France
d Université de Toulouse, IMT, F-31400 Toulouse, France
a r t i c l e i n f o
Article history:
Received 29 August 2012
Accepted 31 August 2014
Available online 28 September 2014
Keywords:
Air traffic conflict problem
B-splines
Continuous optimization
Genetic algorithms
Semi-infinite programming
a b s t r a c t
This paper first introduces an original trajectory model using B-splines and a new semi-infinite program-
ming formulation of the separation constraint involved in air traffic conflict problems. A new continuous
optimization formulation of the tactical conflict-resolution problem is then proposed. It involves very few
optimization variables in that one needs only one optimization variable to determine each aircraft trajec-
tory. Encouraging numerical experiments show that this approach is viable on realistic test problems. Not
only does one not need to rely on the traditional, discretized, combinatorial optimization approaches to this
problem, but, moreover, local continuous optimization methods, which require relatively fewer iterations
and thereby fewer costly function evaluations, are shown to improve the performance of .
This document describes a study that uses discrete event simulation combined with multi-criteria decision analysis to help plan the logistics system of a new steel plant in Brazil. The study evaluates different configurations for the size of the plant's private iron ore vessel fleet and storage capacities. Ten scenarios are simulated and evaluated based on criteria like plant stoppages and investment costs. The results help determine the best fleet size and storage capacities to avoid interruptions in steel production.
Topological Optimization and Genetic Algorithms Used in a Wheel Project for a...Neimar Silva
This document summarizes a study that used topological optimization and genetic algorithms to analyze and optimize the design of wheels for an unmanned aerial vehicle (UAV). The study used finite element analysis software to conduct topological optimization on a simplified 2D model of a wheel. The goal was to reduce the wheel's mass by 50% while maintaining structural integrity. Genetic algorithms from other optimization software were also utilized. The optimized wheel design reduced mass by 40% compared to previous designs. The study found that wheel width had the greatest influence on the aircraft's mechanical performance.
A transportation scheduling management system using decision tree and iterate...IJECEIAES
This paper aimed to develop a delivery truck scheduling management system using a decision tree to support decision-making in selecting a delivery truck. First-in-first-out (FIFO) and decision tree techniques were applied to prioritize loading doors for delivery trucks with the use of iterated local search (ILS) in recommending the route for the transport of goods. Besides, an arrangement of loading doors can be assigned to the door that meets the specified conditions. The experimental results showed that the system was able to assign the job to a delivery truck under the specified conditions that were close to the actual operation at a similarity of 0.80. In addition, the application of ILS suggested the route of the food delivery truck in planning the most effective transportation route with the best total distance.
This document describes a study that uses discrete event simulation (DES) and multi-criteria decision analysis (MCDA) to model and evaluate configurations for a closed-loop maritime transportation system that supplies raw materials to a steel plant. The system transports iron ore from mines to the plant via a fleet of vessels. Ten simulation scenarios that vary fleet size, storage capacities, and iron ore sourcing were evaluated. Key criteria like plant stoppages, costs, and inventory levels were used to score the scenarios. The results aim to help decision makers identify the best configuration for the transportation system.
This paper evokes the vehicle routing problem (VRP) which aims to determine the minimum total cost
pathways for a fleet of heterogeneous vehicles to deliver a set of customers' orders. The inability of
optimization algorithms alone to fully satisfy the needs of logistic managers become obvious in
transportation field due to the spatial nature of such problems. In this context, we couple a geographical
information system (GIS) with a metaheuristic to handle the VRP efficiently then generate a geographical
solution instead of the numerical solution. A real-case instance in a Tunisian region is studied in order to
test the proposed approach.
Time-Cost Trade-Off Analysis in a Construction Project Problem: Case Studyijceronline
In construction project, cost and time reduction is crucial in today’s competitive market respect. Cost and time along with quality of the project play vital role in construction project’s decision. Reduction in cost and time of projects has increased the demand of construction project in the recent years. Trade-off between different conflicting aspects of projects is one of the challenging problems often faced by construction companies. Time, cost and quality of project delivery are the important aspects of each project which lead researchers in developing time-cost trade-off model. These models are serving as important management tool for overcoming the limitation of critical path methods frequently used by company. The objective of time-cost trade-off analysis is to reduce the original project duration with possible least total cost. In this paper critical path method with a heuristic method is used to find out the crash durations and crash costs. A regression analysis is performed to identify the relationship between the times and costs in order to formulize an optimization problem model. The problem is then solved by Matlab program which yields a least cost of $60937 with duration 129.50 ≈130 days. Applying this approach, the result obtained is satisfactory, which is an indication of usefulness of this approach in construction project problems.
HOPX Crossover Operator for the Fixed Charge Logistic Model with Priority Bas...IJECEIAES
In this paper, we are interested to an important Logistic problem modelised us optimization problem. It is the fixed charge transportation problem (FCTP) where the aim is to find the optimal solution which minimizes the objective function containig two costs, variable costs proportional to the amount shipped and fixed cost regardless of the quantity transported. To solve this kind of problem, metaheuristics and evolutionary methods should be applied. Genetic algorithms (GAs) seem to be one of such hopeful approaches which is based both on probability operators (Crossover and mutation) responsible for widen the solution space. The different characteristics of those operators influence on the performance and the quality of the genetic algorithm. In order to improve the performance of the GA to solve the FCTP, we propose a new adapted crossover operator called HOPX with the priority-based encoding by hybridizing the characteristics of the two most performent operators, the Order Crossover (OX) and Positionbased crossover (PX). Numerical results are presented and discussed for several instances showing the performance of the developed approach to obtain optimal solution in reduced time in comparison to GAs with other crossover operators.
Strategic Management in Dynamic Environments MGMT 690Beginning D.docxflorriezhamphrey3065
Strategic Management in Dynamic Environments MGMT 690
Beginning Development of Global Strategies
3-4 Pages
Mike, one of the marketing strategists on your team, stops at your office door wanting to talk. “We use fabrics that are made domestically; however, there are issues with using these same fabrics globally. There are laws and regulations that prevent us from shipping these fabrics to other countries. This is a huge concern. One of our primary selling points is the consistency of quality of our product.”
You confirm Mike’s concern, “That’s an excellent point,” you say. “Now you’ve just given yourself and our team more work for the presentation. I’m sure that will come up. One of the board members used to run a textile plant in China.”
Mike nods his head in agreement. “I imagine textiles will not be the only resource concern,” he says.
Consider the following in your response:
· Why should resources be a concern in a global strategy?
· What resources may be a concern in the country you selected?
· How will this impact the decision to move to the country that you selected?
· How will this impact your competitive strategy in your global market?
MUST USE ACADEMIC SOURCES SUCH AS GOOGLE SCHOLAR, GOVERNMENT, SCHOLARLY REVIEWED ETC.
European Journal of Operational Research 241 (2015) 502–512
Contents lists available at ScienceDirect
European Journal of Operational Research
journal homepage: www.elsevier.com/locate/ejor
Innovative Applications of O.R.
Solving air traffic conflict problems via local continuous optimization
Clément Peyronne a,∗, Andrew R. Conn b, Marcel Mongeau c,d, Daniel Delahaye c,d
a Capgemini, 15 av. du Dr Maurice Grynfogel, 31000 Toulouse, France
b IBM, T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, USA
c ENAC, MAIAA, F-31055 Toulouse, France
d Université de Toulouse, IMT, F-31400 Toulouse, France
a r t i c l e i n f o
Article history:
Received 29 August 2012
Accepted 31 August 2014
Available online 28 September 2014
Keywords:
Air traffic conflict problem
B-splines
Continuous optimization
Genetic algorithms
Semi-infinite programming
a b s t r a c t
This paper first introduces an original trajectory model using B-splines and a new semi-infinite program-
ming formulation of the separation constraint involved in air traffic conflict problems. A new continuous
optimization formulation of the tactical conflict-resolution problem is then proposed. It involves very few
optimization variables in that one needs only one optimization variable to determine each aircraft trajec-
tory. Encouraging numerical experiments show that this approach is viable on realistic test problems. Not
only does one not need to rely on the traditional, discretized, combinatorial optimization approaches to this
problem, but, moreover, local continuous optimization methods, which require relatively fewer iterations
and thereby fewer costly function evaluations, are shown to improve the performance of .
Vehicle route scheduling and transportation cost minimization in a latex indu...IJRES Journal
The vehicle route scheduling problem is concerned with the determination of routes and schedules for a fleet of vehicles to satisfy the demands of a set of customers. The goal of vehicle routing is to schedule multiple suppliers from various places. Vehicle routing has existed since the advent of the Industrial age, when large-scale production became possible. As the complexity and scale of the manufacturing world increased, the task of optimizing vehicle routing grew. The vehicle routing problem is a combinatorial optimization and integer programming problem seeking to service a number of customers with a fleet of vehicles. Often the context is that of delivering goods located at a central depot to customers who have placed orders for such goods or vice-versa. Implicit is the goal of minimizing the cost of distributing the goods. Many methods have been developed for searching for good solutions to the problem, however even for the smallest problems, finding global minimum for the cost function is computationally complex. The paper presents an optimization algorithm using Particle Swarm Optimization (PSO) for the vehicle routing that would enable the logistic manager of a latex industry to minimize the transportation cost and maximize the collection using minimum number of vehicles.
INTEGRATION OF GIS AND OPTIMIZATION ROUTINES FOR THE VEHICLE ROUTING PROBLEMijccmsjournal
This paper evokes the vehicle routing problem (VRP) which aims to determine the minimum total cost pathways for a fleet of heterogeneous vehicles to deliver a set of customers' orders. The inability of optimization algorithms alone to fully satisfy the needs of logistic managers become obvious in transportation field due to the spatial nature of such problems. In this context, we couple a geographical information system (GIS) with a metaheuristic to handle the VRP efficiently then generate a geographical solution instead of the numerical solution. A real-case instance in a Tunisian region is studied in order to
test the proposed approach.
Integration Of Gis And Optimization Routines For The Vehicle Routing Problemijccmsjournal
This document discusses integrating geographic information systems (GIS) and optimization routines to efficiently solve vehicle routing problems (VRP). Specifically, it proposes coupling a GIS with a particle swarm optimization metaheuristic. This allows generating a geographic solution by mapping optimized vehicle routes rather than just a numeric solution. The approach is demonstrated on a real-world VRP case study for a region in Tunisia. Customer locations, roads, and potential routes are modeled in GIS. Particle swarm optimization is then used to determine the minimum cost vehicle routes while respecting vehicle capacities. This integrated GIS-optimization approach allows visualizing optimized routing solutions on maps for practical transportation planning.
Towards a new intelligent traffic system based on deep learning and data int...IJECEIAES
Time series forecasting is an important technique to study the behavior of temporal data in order to forecast the future values, which is widely applied in intelligent traffic systems (ITS). In this paper, several deep learning models were designed to deal with the multivariate time series forecasting problem for the purpose of long-term predicting traffic volume. Simulation results showed that the best forecasts are obtained with the use of two hidden long short-term memory (LSTM) layers: the first with 64 neurons and the second with 32 neurons. Over 93% of the forecasts were made with less than ±2.0% error. The analysis of variances is mainly due to peaks in some extreme conditions. For this purpose, the data was then merged between two different sources: electromagnetic loops and cameras. Data fusion is based on a calibration of the reliability of the sources according to the visibility conditions and time of the day. The integration results were then compared with the real data to prove the improvement of the prediction results in peak periods after the data fusion step.
A Minimum Spanning Tree Approach of Solving a Transportation Probleminventionjournals
: This work centered on the transportation problem in the shipment of cable troughs for an underground cable installation from three supply ends to four locations at a construction site where they are needed; in which case, we sought to minimize the cost of shipment. The problem was modeled into a bipartite network representation and solved using the Kruskal method of minimum spanning tree; after which the solution was confirmed with TORA Optimization software version 2.00. The result showed that the cost obtained in shipping the cable troughs under the application of the method, which was AED 2,022,000 (in the United Arab Emirate Dollar), was more effective than that obtained from mere heuristics when compared
This white paper presents a spatial decision support system (SDSS) aimed at generating optimized vehicles routes for multiple vehicles routing problems that involves serving the demand located at nodes of a transportation network. The SDSS incorporates MapPointTM (cartography and network data), a database and a metaheuristic developed generate routes.
IJPR (2015) A Distance-based Methodology for Increased Extraction Of Informat...Nicky Campbell-Allen
This document describes a new methodology for incorporating information from the roof matrices in Quality Function Deployment (QFD) studies. The roof matrices contain correlations between customer requirements (voice of customers) and technical characteristics, but existing methods for including this information in QFD analyses have limitations. The proposed new methodology uses the Manhattan Distance Measure to integrate roof matrix correlation data into the final weightings of technical characteristics. This provides a more consistent way to select technical characteristics by identifying those that are negatively or positively correlated. The methodology is demonstrated using a published QFD case study.
With the development of the urbanization, industrialization and populace, there has been a huge development in the rush hour gridlock. With development in the rush hour gridlock, there got a heap of issues with it as well, these issues incorporate congested roads, mishaps and movement govern infringement at the overwhelming activity signals. This thusly adversy affects the economy of the nation and in addition the loss of lives. Thus, Speed control is in the need of great importance because of the expanded rate of mishaps announced in our everyday life. The criminal traffic offense expanded due to over movement on streets. The reason is rapid of vehicles. The speed of the vehicles is past the normal speed confine is called speed infringement. In this paper diverse issues are confronted that are given in issue detailing. Every one of these issues are in future with the assistance of the fortification learning issue and advancement issue the changed neural system is contemplated with NN calculations forward Chaining back spread . Omesh Goyal | Chamkour Singh ""A Review on Traffic Signal Identification"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-4 , June 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23557.pdf
Paper URL: https://www.ijtsrd.com/engineering/computer-engineering/23557/a-review-on-traffic-signal-identification/omesh-goyal
This document provides a review of using x-ray computed tomography (XCT) for additive manufacturing (AM). It begins with introductions to the principles of XCT and various AM processes. Historically, XCT and AM were first combined in 1990 to create a 3D model of a skull for medical purposes. Between 1995-2005, uses expanded from medical modeling to include XCT being used as an inspection tool to quantitatively measure AM parts. Current research focuses on using XCT for porosity measurements and general dimensional measurements of AM parts. Limitations in resolution hinder porosity measurements, while surface texture measurement needs more research.
Heuristic Techniques for the Design of Steel-Concrete Composite Pedestrian Br...► Victor Yepes
The objective of this work was to apply heuristic optimization techniques to a steel-concrete composite pedestrian bridge, modeled like a beam on two supports. A program has been developed in Fortran programming language, capable of generating pedestrian bridges, checking them, and evaluating their cost. The following algorithms were implemented: descent local search (DLS), a hybrid simulated annealing with a mutation operator (SAMO2), and a glow-worms swarm optimization (GSO) in two variants. The first one only considers the GSO and the second combines GSO and DLS, applying the DSL heuristic to the best solutions obtained by the GSO. The results were compared according to the lowest cost. The GSO and DLS algorithms combined obtained the best results in terms of cost. Furthermore, a comparison between the CO2 emissions associated with the amount of materials obtained by every heuristic technique and the original design solution were studied. Finally, a parametric study was carried out according to the span length of the pedestrian bridge.
This document proposes integrating a macroscopic traffic flow model (METANET) with a microscopic dynamic emission and fuel consumption model (VT-Micro) to enable model-based dynamic traffic control. The control aims to reduce emissions, fuel consumption, and travel time using dynamic speed limit control. Simulation results indicate this approach can balance the conflicting objectives of reducing environmental impacts while improving traffic flow.
This document discusses the application of a lattice-Boltzmann computational fluid dynamics (CFD) code for automobile and motorcycle aerodynamics simulations at BMW. It begins by explaining how CFD is used alongside wind tunnel testing to analyze vehicle designs earlier in the development process. It then provides details on the lattice-Boltzmann method, including describing the mesoscopic approach, kinetic theory, and the concepts of the lattice model. The document explains how macroscopic fluid properties emerge from microscopic particle distributions and collisions in the model.
2019-2020 research findings in Public Transit from the Centre for Transport Studies, University of TWENTE. The presented findings at the Transportation Research board include overcrowding, operational control, electric buses, and train assignment.
- The document proposes grey-box models that combine physics-based Morison's equation and data-based Gaussian process models to improve prediction of wave loading on offshore structures.
- Morison's equation is used as the physics component to predict wave loading from assumed wave particle velocities and accelerations. Gaussian process NARX models are used as the data-based components.
- Two approaches are presented for combining the white-box and black-box components: 1) simple summation, and 2) using the white-box prediction as additional input to the black-box. The best approach was found to be a residual modelling GP-NARX.
A Computer Model for Selecting Equipment for Earthmoving Operations Using Sim...Hassan Eliwa
This document presents a computer model called PROEQUIP for selecting equipment for earthmoving operations using simulation. PROEQUIP allows users to input project data and choose from databases of equipment options. It then runs simulations to determine the fleet configuration that provides the maximum production and minimum cost. The document describes the model components, assumptions, and provides examples of case studies where PROEQUIP is used to analyze two earthmoving projects and select the optimal equipment for each. It concludes that PROEQUIP is an effective tool for decision makers to evaluate equipment options for earthmoving planning and management.
MODERN TECHNOLOGIES USE IN TRANSPORTATION ENGINEERINGIRJET Journal
This document discusses modern technologies that can impact transportation engineering. It reviews areas where advanced technologies can improve transportation, including vehicular navigation and control using GPS, computer-aided planning and design systems, robotics and automation applications for construction and maintenance, and machine vision for vehicle detection instead of sensors embedded in roads. The technologies offer potential for increased efficiency, cost savings, quality improvements and safety benefits. Widespread adoption of these technologies in transportation could require changes to engineering practice and education.
Evolutionary reinforcement learning multi-agents system for intelligent traf...IJECEIAES
The document summarizes a research paper that proposes a new approach called evolutionary reinforcement learning multi-agents system (ERL-MA) for intelligent traffic light control. The ERL-MA system combines computational intelligence and machine learning. It consists of two layers: a modeling layer that uses intersection modeling to understand junction constraints, and a decision layer that uses a novel greedy genetic algorithm and Q-learning to determine optimal phase sequences and signal timings. The approach is evaluated using a real-world traffic simulation scenario from Bologna, Italy. Results show the ERL-MA system achieves competitive performance compared to other adaptive traffic control systems in terms of various metrics.
Solving real world delivery problem using improved max-min ant system with lo...ijaia
This paper presents a solution to real-world delive
ry problems (RWDPs) for home delivery services wher
e
a large number of roads exist in cities and the tra
ffic on the roads rapidly changes with time. The
methodology for finding the shortest-travel-time to
ur includes a hybrid meta-heuristic that combines a
nt
colony optimization (ACO) with Dijkstra’s algorithm
, a search technique that uses both real-time traff
ic
and predicted traffic, and a way to use a real-worl
d road map and measured traffic in Japan. We
previously proposed a hybrid ACO for RWDPs that use
d a MAX-MIN Ant System (MMAS) and proposed a
method to improve the search rate of MMAS. Since tr
affic on roads changes with time, the search rate i
s
important in RWDPs. In the current work, we combine
the hybrid ACO method with the improved MMAS.
Experimental results using a map of central Tokyo a
nd historical traffic data indicate that the propos
ed
method can find a better solution than conventional
methods.
This document describes a distributed simulation model of maritime logistics in an iron ore supply chain. The model is composed of multiple simulation models representing individual ports and navigation routes. Each port is modeled generically to represent any iron ore port. The port and navigation models interact through a distributed simulation framework to simulate material and information flow throughout the entire supply chain. The model is intended to support fleet management decisions for a large mining company.
The document discusses offensive speech and the FBI's priority to protect citizens from hate crimes and terrorism. While the First Amendment protects free speech, the government's view of offensive speech has evolved over time. Courts play a key role in protecting free speech from government overregulation based on interpreting the First Amendment.
How To Write An Opinion Essay Essay TigersMonica Waters
This document discusses HR recruitment practices for hiring employees. It explains that HR recruitment was originally used primarily by large corporations but is now common for many ordinary companies as well. The needs of HR recruitment in organizations have changed in recent years, and the process now exists in most organizations to improve efficiency. The recruitment system is at the heart of every business, so ensuring consistency at every level is important to enhance effectiveness in hiring and retention.
More Related Content
Similar to A Comparative Study On Swarm-Based Algorithms To Solve The Stochastic Optimization Problem In Container Terminal Design
Vehicle route scheduling and transportation cost minimization in a latex indu...IJRES Journal
The vehicle route scheduling problem is concerned with the determination of routes and schedules for a fleet of vehicles to satisfy the demands of a set of customers. The goal of vehicle routing is to schedule multiple suppliers from various places. Vehicle routing has existed since the advent of the Industrial age, when large-scale production became possible. As the complexity and scale of the manufacturing world increased, the task of optimizing vehicle routing grew. The vehicle routing problem is a combinatorial optimization and integer programming problem seeking to service a number of customers with a fleet of vehicles. Often the context is that of delivering goods located at a central depot to customers who have placed orders for such goods or vice-versa. Implicit is the goal of minimizing the cost of distributing the goods. Many methods have been developed for searching for good solutions to the problem, however even for the smallest problems, finding global minimum for the cost function is computationally complex. The paper presents an optimization algorithm using Particle Swarm Optimization (PSO) for the vehicle routing that would enable the logistic manager of a latex industry to minimize the transportation cost and maximize the collection using minimum number of vehicles.
INTEGRATION OF GIS AND OPTIMIZATION ROUTINES FOR THE VEHICLE ROUTING PROBLEMijccmsjournal
This paper evokes the vehicle routing problem (VRP) which aims to determine the minimum total cost pathways for a fleet of heterogeneous vehicles to deliver a set of customers' orders. The inability of optimization algorithms alone to fully satisfy the needs of logistic managers become obvious in transportation field due to the spatial nature of such problems. In this context, we couple a geographical information system (GIS) with a metaheuristic to handle the VRP efficiently then generate a geographical solution instead of the numerical solution. A real-case instance in a Tunisian region is studied in order to
test the proposed approach.
Integration Of Gis And Optimization Routines For The Vehicle Routing Problemijccmsjournal
This document discusses integrating geographic information systems (GIS) and optimization routines to efficiently solve vehicle routing problems (VRP). Specifically, it proposes coupling a GIS with a particle swarm optimization metaheuristic. This allows generating a geographic solution by mapping optimized vehicle routes rather than just a numeric solution. The approach is demonstrated on a real-world VRP case study for a region in Tunisia. Customer locations, roads, and potential routes are modeled in GIS. Particle swarm optimization is then used to determine the minimum cost vehicle routes while respecting vehicle capacities. This integrated GIS-optimization approach allows visualizing optimized routing solutions on maps for practical transportation planning.
Towards a new intelligent traffic system based on deep learning and data int...IJECEIAES
Time series forecasting is an important technique to study the behavior of temporal data in order to forecast the future values, which is widely applied in intelligent traffic systems (ITS). In this paper, several deep learning models were designed to deal with the multivariate time series forecasting problem for the purpose of long-term predicting traffic volume. Simulation results showed that the best forecasts are obtained with the use of two hidden long short-term memory (LSTM) layers: the first with 64 neurons and the second with 32 neurons. Over 93% of the forecasts were made with less than ±2.0% error. The analysis of variances is mainly due to peaks in some extreme conditions. For this purpose, the data was then merged between two different sources: electromagnetic loops and cameras. Data fusion is based on a calibration of the reliability of the sources according to the visibility conditions and time of the day. The integration results were then compared with the real data to prove the improvement of the prediction results in peak periods after the data fusion step.
A Minimum Spanning Tree Approach of Solving a Transportation Probleminventionjournals
: This work centered on the transportation problem in the shipment of cable troughs for an underground cable installation from three supply ends to four locations at a construction site where they are needed; in which case, we sought to minimize the cost of shipment. The problem was modeled into a bipartite network representation and solved using the Kruskal method of minimum spanning tree; after which the solution was confirmed with TORA Optimization software version 2.00. The result showed that the cost obtained in shipping the cable troughs under the application of the method, which was AED 2,022,000 (in the United Arab Emirate Dollar), was more effective than that obtained from mere heuristics when compared
This white paper presents a spatial decision support system (SDSS) aimed at generating optimized vehicles routes for multiple vehicles routing problems that involves serving the demand located at nodes of a transportation network. The SDSS incorporates MapPointTM (cartography and network data), a database and a metaheuristic developed generate routes.
IJPR (2015) A Distance-based Methodology for Increased Extraction Of Informat...Nicky Campbell-Allen
This document describes a new methodology for incorporating information from the roof matrices in Quality Function Deployment (QFD) studies. The roof matrices contain correlations between customer requirements (voice of customers) and technical characteristics, but existing methods for including this information in QFD analyses have limitations. The proposed new methodology uses the Manhattan Distance Measure to integrate roof matrix correlation data into the final weightings of technical characteristics. This provides a more consistent way to select technical characteristics by identifying those that are negatively or positively correlated. The methodology is demonstrated using a published QFD case study.
With the development of the urbanization, industrialization and populace, there has been a huge development in the rush hour gridlock. With development in the rush hour gridlock, there got a heap of issues with it as well, these issues incorporate congested roads, mishaps and movement govern infringement at the overwhelming activity signals. This thusly adversy affects the economy of the nation and in addition the loss of lives. Thus, Speed control is in the need of great importance because of the expanded rate of mishaps announced in our everyday life. The criminal traffic offense expanded due to over movement on streets. The reason is rapid of vehicles. The speed of the vehicles is past the normal speed confine is called speed infringement. In this paper diverse issues are confronted that are given in issue detailing. Every one of these issues are in future with the assistance of the fortification learning issue and advancement issue the changed neural system is contemplated with NN calculations forward Chaining back spread . Omesh Goyal | Chamkour Singh ""A Review on Traffic Signal Identification"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-4 , June 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23557.pdf
Paper URL: https://www.ijtsrd.com/engineering/computer-engineering/23557/a-review-on-traffic-signal-identification/omesh-goyal
This document provides a review of using x-ray computed tomography (XCT) for additive manufacturing (AM). It begins with introductions to the principles of XCT and various AM processes. Historically, XCT and AM were first combined in 1990 to create a 3D model of a skull for medical purposes. Between 1995-2005, uses expanded from medical modeling to include XCT being used as an inspection tool to quantitatively measure AM parts. Current research focuses on using XCT for porosity measurements and general dimensional measurements of AM parts. Limitations in resolution hinder porosity measurements, while surface texture measurement needs more research.
Heuristic Techniques for the Design of Steel-Concrete Composite Pedestrian Br...► Victor Yepes
The objective of this work was to apply heuristic optimization techniques to a steel-concrete composite pedestrian bridge, modeled like a beam on two supports. A program has been developed in Fortran programming language, capable of generating pedestrian bridges, checking them, and evaluating their cost. The following algorithms were implemented: descent local search (DLS), a hybrid simulated annealing with a mutation operator (SAMO2), and a glow-worms swarm optimization (GSO) in two variants. The first one only considers the GSO and the second combines GSO and DLS, applying the DSL heuristic to the best solutions obtained by the GSO. The results were compared according to the lowest cost. The GSO and DLS algorithms combined obtained the best results in terms of cost. Furthermore, a comparison between the CO2 emissions associated with the amount of materials obtained by every heuristic technique and the original design solution were studied. Finally, a parametric study was carried out according to the span length of the pedestrian bridge.
This document proposes integrating a macroscopic traffic flow model (METANET) with a microscopic dynamic emission and fuel consumption model (VT-Micro) to enable model-based dynamic traffic control. The control aims to reduce emissions, fuel consumption, and travel time using dynamic speed limit control. Simulation results indicate this approach can balance the conflicting objectives of reducing environmental impacts while improving traffic flow.
This document discusses the application of a lattice-Boltzmann computational fluid dynamics (CFD) code for automobile and motorcycle aerodynamics simulations at BMW. It begins by explaining how CFD is used alongside wind tunnel testing to analyze vehicle designs earlier in the development process. It then provides details on the lattice-Boltzmann method, including describing the mesoscopic approach, kinetic theory, and the concepts of the lattice model. The document explains how macroscopic fluid properties emerge from microscopic particle distributions and collisions in the model.
2019-2020 research findings in Public Transit from the Centre for Transport Studies, University of TWENTE. The presented findings at the Transportation Research board include overcrowding, operational control, electric buses, and train assignment.
- The document proposes grey-box models that combine physics-based Morison's equation and data-based Gaussian process models to improve prediction of wave loading on offshore structures.
- Morison's equation is used as the physics component to predict wave loading from assumed wave particle velocities and accelerations. Gaussian process NARX models are used as the data-based components.
- Two approaches are presented for combining the white-box and black-box components: 1) simple summation, and 2) using the white-box prediction as additional input to the black-box. The best approach was found to be a residual modelling GP-NARX.
A Computer Model for Selecting Equipment for Earthmoving Operations Using Sim...Hassan Eliwa
This document presents a computer model called PROEQUIP for selecting equipment for earthmoving operations using simulation. PROEQUIP allows users to input project data and choose from databases of equipment options. It then runs simulations to determine the fleet configuration that provides the maximum production and minimum cost. The document describes the model components, assumptions, and provides examples of case studies where PROEQUIP is used to analyze two earthmoving projects and select the optimal equipment for each. It concludes that PROEQUIP is an effective tool for decision makers to evaluate equipment options for earthmoving planning and management.
MODERN TECHNOLOGIES USE IN TRANSPORTATION ENGINEERINGIRJET Journal
This document discusses modern technologies that can impact transportation engineering. It reviews areas where advanced technologies can improve transportation, including vehicular navigation and control using GPS, computer-aided planning and design systems, robotics and automation applications for construction and maintenance, and machine vision for vehicle detection instead of sensors embedded in roads. The technologies offer potential for increased efficiency, cost savings, quality improvements and safety benefits. Widespread adoption of these technologies in transportation could require changes to engineering practice and education.
Evolutionary reinforcement learning multi-agents system for intelligent traf...IJECEIAES
The document summarizes a research paper that proposes a new approach called evolutionary reinforcement learning multi-agents system (ERL-MA) for intelligent traffic light control. The ERL-MA system combines computational intelligence and machine learning. It consists of two layers: a modeling layer that uses intersection modeling to understand junction constraints, and a decision layer that uses a novel greedy genetic algorithm and Q-learning to determine optimal phase sequences and signal timings. The approach is evaluated using a real-world traffic simulation scenario from Bologna, Italy. Results show the ERL-MA system achieves competitive performance compared to other adaptive traffic control systems in terms of various metrics.
Solving real world delivery problem using improved max-min ant system with lo...ijaia
This paper presents a solution to real-world delive
ry problems (RWDPs) for home delivery services wher
e
a large number of roads exist in cities and the tra
ffic on the roads rapidly changes with time. The
methodology for finding the shortest-travel-time to
ur includes a hybrid meta-heuristic that combines a
nt
colony optimization (ACO) with Dijkstra’s algorithm
, a search technique that uses both real-time traff
ic
and predicted traffic, and a way to use a real-worl
d road map and measured traffic in Japan. We
previously proposed a hybrid ACO for RWDPs that use
d a MAX-MIN Ant System (MMAS) and proposed a
method to improve the search rate of MMAS. Since tr
affic on roads changes with time, the search rate i
s
important in RWDPs. In the current work, we combine
the hybrid ACO method with the improved MMAS.
Experimental results using a map of central Tokyo a
nd historical traffic data indicate that the propos
ed
method can find a better solution than conventional
methods.
This document describes a distributed simulation model of maritime logistics in an iron ore supply chain. The model is composed of multiple simulation models representing individual ports and navigation routes. Each port is modeled generically to represent any iron ore port. The port and navigation models interact through a distributed simulation framework to simulate material and information flow throughout the entire supply chain. The model is intended to support fleet management decisions for a large mining company.
Similar to A Comparative Study On Swarm-Based Algorithms To Solve The Stochastic Optimization Problem In Container Terminal Design (20)
The document discusses offensive speech and the FBI's priority to protect citizens from hate crimes and terrorism. While the First Amendment protects free speech, the government's view of offensive speech has evolved over time. Courts play a key role in protecting free speech from government overregulation based on interpreting the First Amendment.
How To Write An Opinion Essay Essay TigersMonica Waters
This document discusses HR recruitment practices for hiring employees. It explains that HR recruitment was originally used primarily by large corporations but is now common for many ordinary companies as well. The needs of HR recruitment in organizations have changed in recent years, and the process now exists in most organizations to improve efficiency. The recruitment system is at the heart of every business, so ensuring consistency at every level is important to enhance effectiveness in hiring and retention.
Essay Contest Opens For High School Students NIH RecordMonica Waters
The article examines symbolic play in children with Autism Spectrum Disorder compared to typically
developing children. It found that children with ASD engaged in significantly less symbolic play and had
more difficulties with pretend play skills. The results suggest that assessing pretend play abilities can help
identify children with ASD and developing pretend play skills should be a focus of early intervention.
Edit My College Essay. 10 Most Common College EsMonica Waters
The document provides information about editing college essays through an online service. It outlines a 5-step process: 1) Create an account; 2) Complete an order form with instructions and deadline; 3) Review writer bids and choose one; 4) Review the paper and authorize payment; 5) Request revisions until satisfied. It emphasizes original, high-quality work and refunds for plagiarism.
1. The document discusses a website called HelpWriting.net that provides writing assistance services.
2. It outlines a 5-step process for using their services, which includes creating an account, submitting a request form, reviewing writer bids, authorizing payment, and requesting revisions.
3. They promise original, high-quality work and refunds for plagiarized content, aiming to fully meet customer needs.
Persuasive Writing Paragraph. How To Write AMonica Waters
The document discusses the impact of media on children's lives and socialization. It notes that media is an influential factor in socialization, especially for children. Media can positively impact children by exposing them to new ideas and information. However, excessive media use can negatively impact children's development by replacing social interactions and outdoor activities. The document calls for moderation and guidance when children consume media to maximize the benefits and minimize the risks.
How Does Nurture Influence Development. How Does NMonica Waters
The document discusses how nurture influences development through several steps:
1. Create an account on the site to request writing help
2. Complete an order form providing instructions, sources, deadline, and sample work
3. Review bids from writers and choose one based on qualifications to start the assignment
4. Review the completed paper and authorize payment if pleased, with options for revisions
5. Request multiple revisions to ensure satisfaction, with a guarantee of original work or a refund
View Formal Essay Examples For High SchooMonica Waters
The document provides instructions for requesting and completing an assignment writing request on the HelpWriting.net website. It outlines a 5-step process: 1) Create an account with an email and password. 2) Complete a 10-minute order form providing instructions, sources, and deadline. 3) Review bids from writers and choose one based on qualifications. 4) Review the completed paper and authorize payment if satisfied. 5) Request revisions until fully satisfied, with the option of a full refund for plagiarized work. The purpose is to outline the simple process for students to request writing help from the website.
1. Racism led to an unjust legal system where Tom Robinson, an innocent black man, was wrongly convicted of a crime and sentenced to death simply due to the color of his skin and prejudice of the all-white jury.
2. The racist attitudes prevalent in Maycomb caused Atticus to receive threats and face hostility from many in the town for agreeing to defend Tom Robinson, a black man.
3. Jem and Scout witnessed the ugly realities of racism through the mob that gathered outside the jail to lynch Tom Robinson before the trial, showing them the deep prejudice that existed. Racism shaped how the
The document discusses the steps to request writing assistance from HelpWriting.net:
1. Create an account with a password and valid email.
2. Complete a 10-minute order form providing instructions, sources, deadline, and attaching a sample for style imitation.
3. Review bids from writers for the request, choose one based on qualifications, and place a deposit to start.
4. Review the paper and authorize full payment if pleased, or request free revisions.
5. Multiple revisions are allowed to ensure satisfaction, and plagiarized work results in a full refund.
1) The U.S. already spends more on defense than the next several countries combined, indicating current spending levels are excessive.
2) Increasing defense spending would divert funding from critical domestic programs like education, healthcare, and infrastructure that Americans rely on.
3) With no major military threats on the horizon, additional defense spending provides few benefits while adding to the national debt burden.
Writing Cause And Effect Essay Examples - DefinitivMonica Waters
The passage discusses the Confucian philosophy and two influential Confucian thinkers, Mengzi and Xunzi. It notes that while Confucius sought to spread his teachings, later philosophers like Mengzi and Xunzi interpreted and debated his ideas, specifically around the question of whether human nature is inherently good or bad. The author argues against Mengzi's view that human nature is inherently good, instead asserting that it is completely self-interested.
How To Write A Compare And Contrast Essay Example. CMonica Waters
Here are a few key points about black women in America and their accomplishments:
- Bessie Coleman was the first African American and first Native American woman to hold an
international pilot license. She started her aviation career in 1921 after being denied flight lessons in
the U.S. due to her race and gender.
- Cathay Williams was the first African American woman to serve in the U.S. Army, enlisting in 1866
and serving until 1868. She disguised herself as a man in order to join.
- Madam C.J. Walker was America's first female self-made millionaire. She built a highly successful
business creating and selling hair care products for black women in the early
The document describes a 5-step process for obtaining writing assistance from HelpWriting.net:
1. Create an account with a password and email.
2. Complete a 10-minute order form providing instructions, sources, deadline, and sample work.
3. Choose a writer bid based on qualifications, history, and feedback, then pay a deposit.
4. Review the completed paper and authorize full payment or request revisions.
5. Request revisions to ensure satisfaction, and HelpWriting.net guarantees original, high-quality work with refunds for plagiarism.
How Serious Is Essay Plagiarism Students The GuardianMonica Waters
The document provides instructions for students to get writing help from HelpWriting.net. It outlines a 5-step process: 1) Create an account with an email and password. 2) Complete an order form with instructions, sources, and deadline. 3) Review bids from writers and choose one. 4) Receive the paper and authorize payment if satisfied. 5) Request revisions until satisfied, with a refund option for plagiarism. The process aims to ensure students get high-quality, original content through competitive bidding and revisions.
The document discusses drugs and alcohol in the criminal justice system. It notes that drug and alcohol abuse has long been part of human culture and American society. The period from 1950-2000 saw significant developments in how drugs and alcohol were viewed and addressed. Research and knowledge advanced, laws were passed, media coverage increased, and public views shifted. Overall, this time period was exceptionally active for American culture in terms of drugs and alcohol.
Essay Websites Examples Of Satire EssaysMonica Waters
The document discusses the author's experience visiting Yosemite National Park for the first time, expressing a sense of awe at the natural beauty of the park, including views of El Capitan. Yosemite National Park is located in California's Sierra Nevada mountains and was established in 1890 to protect its outstanding natural features spanning over 747,956 acres, including waterfalls, trees, cliffs and mountains. In just one hour at the park, the author was already amazed by what they had seen.
The document discusses the national nanotechnology initiative (NNI) and nanotechnology. It begins by defining nanotechnology as the study and manipulation of materials at the 1 to 100 nanometer scale, where materials exhibit novel properties due to their small size. It notes that the NNI was established to provide a general definition of nanotechnology. The document then discusses how nanoscience involves the study of nanomaterials, which have at least one dimension in the 1 to 100 nm range. It states that these nanomaterials have increased surface area and unique physical and chemical properties compared to larger materials.
Writing An Abstract For Your Research Paper The Writing Center UW ...Monica Waters
- AI systems in warfare could potentially reduce casualties by taking the place of human soldiers in dangerous situations. However, lethal autonomous weapons raise concerns about machines having the power to take human lives without meaningful human control.
- The opacity of advanced AI may make it difficult for humans to understand the system's decisions and determine accountability for any mistakes or ethical lapses. Without explainability, issues could arise regarding responsibility for the actions of AI systems.
- Developing AI for military use, including lethal applications, risks an arms race as nations work to gain strategic advantages over opponents. This could destabilize existing security frameworks and escalate conflicts.
Analytical Essay My First Day At School Short EssayMonica Waters
The document discusses a case study involving a business relationship between the author and Mr. Marshall. It began informally six months ago with the author supplying grapes to Mr. Marshall's health food store. Demand grew but issues arose regarding late or incomplete payments from Mr. Marshall. The author is considering ending the business relationship and asks what legal actions Mr. Marshall could take and what defenses they may have. Advice is sought on resolving disputes biblically to avoid negative impacts on both parties.
This presentation includes basic of PCOS their pathology and treatment and also Ayurveda correlation of PCOS and Ayurvedic line of treatment mentioned in classics.
Leveraging Generative AI to Drive Nonprofit InnovationTechSoup
In this webinar, participants learned how to utilize Generative AI to streamline operations and elevate member engagement. Amazon Web Service experts provided a customer specific use cases and dived into low/no-code tools that are quick and easy to deploy through Amazon Web Service (AWS.)
A review of the growth of the Israel Genealogy Research Association Database Collection for the last 12 months. Our collection is now passed the 3 million mark and still growing. See which archives have contributed the most. See the different types of records we have, and which years have had records added. You can also see what we have for the future.
How to Setup Warehouse & Location in Odoo 17 InventoryCeline George
In this slide, we'll explore how to set up warehouses and locations in Odoo 17 Inventory. This will help us manage our stock effectively, track inventory levels, and streamline warehouse operations.
বাংলাদেশের অর্থনৈতিক সমীক্ষা ২০২৪ [Bangladesh Economic Review 2024 Bangla.pdf] কম্পিউটার , ট্যাব ও স্মার্ট ফোন ভার্সন সহ সম্পূর্ণ বাংলা ই-বুক বা pdf বই " সুচিপত্র ...বুকমার্ক মেনু 🔖 ও হাইপার লিংক মেনু 📝👆 যুক্ত ..
আমাদের সবার জন্য খুব খুব গুরুত্বপূর্ণ একটি বই ..বিসিএস, ব্যাংক, ইউনিভার্সিটি ভর্তি ও যে কোন প্রতিযোগিতা মূলক পরীক্ষার জন্য এর খুব ইম্পরট্যান্ট একটি বিষয় ...তাছাড়া বাংলাদেশের সাম্প্রতিক যে কোন ডাটা বা তথ্য এই বইতে পাবেন ...
তাই একজন নাগরিক হিসাবে এই তথ্য গুলো আপনার জানা প্রয়োজন ...।
বিসিএস ও ব্যাংক এর লিখিত পরীক্ষা ...+এছাড়া মাধ্যমিক ও উচ্চমাধ্যমিকের স্টুডেন্টদের জন্য অনেক কাজে আসবে ...
This document provides an overview of wound healing, its functions, stages, mechanisms, factors affecting it, and complications.
A wound is a break in the integrity of the skin or tissues, which may be associated with disruption of the structure and function.
Healing is the body’s response to injury in an attempt to restore normal structure and functions.
Healing can occur in two ways: Regeneration and Repair
There are 4 phases of wound healing: hemostasis, inflammation, proliferation, and remodeling. This document also describes the mechanism of wound healing. Factors that affect healing include infection, uncontrolled diabetes, poor nutrition, age, anemia, the presence of foreign bodies, etc.
Complications of wound healing like infection, hyperpigmentation of scar, contractures, and keloid formation.
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UPRAHUL
This Dissertation explores the particular circumstances of Mirzapur, a region located in the
core of India. Mirzapur, with its varied terrains and abundant biodiversity, offers an optimal
environment for investigating the changes in vegetation cover dynamics. Our study utilizes
advanced technologies such as GIS (Geographic Information Systems) and Remote sensing to
analyze the transformations that have taken place over the course of a decade.
The complex relationship between human activities and the environment has been the focus
of extensive research and worry. As the global community grapples with swift urbanization,
population expansion, and economic progress, the effects on natural ecosystems are becoming
more evident. A crucial element of this impact is the alteration of vegetation cover, which plays a
significant role in maintaining the ecological equilibrium of our planet.Land serves as the foundation for all human activities and provides the necessary materials for
these activities. As the most crucial natural resource, its utilization by humans results in different
'Land uses,' which are determined by both human activities and the physical characteristics of the
land.
The utilization of land is impacted by human needs and environmental factors. In countries
like India, rapid population growth and the emphasis on extensive resource exploitation can lead
to significant land degradation, adversely affecting the region's land cover.
Therefore, human intervention has significantly influenced land use patterns over many
centuries, evolving its structure over time and space. In the present era, these changes have
accelerated due to factors such as agriculture and urbanization. Information regarding land use and
cover is essential for various planning and management tasks related to the Earth's surface,
providing crucial environmental data for scientific, resource management, policy purposes, and
diverse human activities.
Accurate understanding of land use and cover is imperative for the development planning
of any area. Consequently, a wide range of professionals, including earth system scientists, land
and water managers, and urban planners, are interested in obtaining data on land use and cover
changes, conversion trends, and other related patterns. The spatial dimensions of land use and
cover support policymakers and scientists in making well-informed decisions, as alterations in
these patterns indicate shifts in economic and social conditions. Monitoring such changes with the
help of Advanced technologies like Remote Sensing and Geographic Information Systems is
crucial for coordinated efforts across different administrative levels. Advanced technologies like
Remote Sensing and Geographic Information Systems
9
Changes in vegetation cover refer to variations in the distribution, composition, and overall
structure of plant communities across different temporal and spatial scales. These changes can
occur natural.
A Comparative Study On Swarm-Based Algorithms To Solve The Stochastic Optimization Problem In Container Terminal Design
1. International Journal of Technology 11(2) 374-387 (2020)
Received June 2018 / Revised March 2020 / Accepted March 2020
International Journal of Technology
http://ijtech.eng.ui.ac.id
A Comparative Study on Swarm-based Algorithms to Solve the Stochastic
Optimization Problem in Container Terminal Design
Febri Zukhruf1*, Russ Bona Frazila1, Wijang Widhiarso2
1Faculty of Civil and Environmental Engineering, Institut Teknologi Bandung, Jl. Ganesha No. 10, Bandung
40132, Indonesia
2Faculty of Information Technology, Multi Data Palembang Bachelor Program, Palembang 30113, Indonesia
Abstract. This study compared swarm-based algorithms in terms of their effectiveness in
improving the design of facilities in container terminals (CTs). The design was conducted within the
framework of stochastic discrete optimization and involved determining the number of equipment
needed in CTs by considering variations in demand and the productivity of facilities—issues that
are rarely elaborated in CT design. Variations were identified via Monte Carlo simulation
characterized by a particular distribution. The conflicting issue due to increments in equipment
investment that possibly cause the distribution delays was also modeled, specifically in relation to
the increasing number of trucks used in terminals. Given that the optimization problem is typified
by numerous combinations of actions, the swarm-based algorithms were deployed to develop a
feasible solution. A new variant of glowworm swarm optimization (GSO) was then proposed and
compared with particle swarm optimization (PSO) algorithms. The numerical results showed that
the performance of the proposed GSO is superior to that of PSO algorithms.
Keywords: Design of container terminal facilities; Glowworm swarm optimization; Particle swarm
optimization; Stochastic optimization.
1. Introduction
As an essential part of annually expanding global trade, the container shipping industry
has been compelled to extensively develop container terminals (CTs) by investing in large-
scale equipment and advanced hardware for tackling container flows (Mishra et al., 2017).
This development has correspondingly increased the complexity of CT operations, which
encompass interactions among resources, entities, and activities. Such interactions begin at
the seaside, where a vessel requires assistance from a tugboat for berthing. After berthing,
quay cranes (QCs) simultaneously handle containers and transport them to a loading dock
or transport vehicles. Multiple transport vehicles then convey the containers to a stacking
yard, where smooth distribution is considerably facilitated by the existence of an internal
road network. Cumulatively, these interactions reflect seaport performance, which is
manifested in different forms that range from operational performance (Cartenì 2012 Luca,
2012) to environmental performance (Budiyanto et al., 2019).
The above-mentioned interactions equally contribute to the complexity of CT
operations, which is hardly represented in analytical models (Dragović et al., 2017).
*Corresponding author’s email: febri.zukhruf@ftsl.itb.ac.id,, Tel.: +62 22 250 4952; Fax.: +62 22 251 6586
doi: 10.14716/ijtech.v11i2.2090
2. Zukhruf et al. 375
This deficiency prompted researchers to pay increasing attention to the use of simulation
models in depicting how CTs are run. In line with this trend, the current research
constructed a simulation model on the basis of the Monte Carlo (MC) framework. As part of
a stochastic-based procedure, the MC framework can uncover the expected values of
components through randomization processes. These processes generate a random number
iteratively, thereby creating various event scenarios that illustrate the stochasticity that
characterizes CT operations.
The complexity of CT operations can likewise be viewed as an optimization problem,
whose resolution lies in selecting the action that best enhances the performance of CTs.
Given that CTs operate under uncertainties (i.e., variations at the demand and supply sides),
this study also established a stochastic optimization model that directly incorporates
uncertainty into the decision-making process. In this model, variations in vessel size are the
uncertainties manifested in the demand side, whereas fluctuations in equipment
productivity represent the uncertainties in the supply side. The stochastic modeling also
considered the QCs, container truck-trailer units (TTUs), and container yard equipment
[i.e., rubber tyred gantry crane (RTGC)] employed in CT operations. Because an increment
in TTUs used potentially causes delays at land-side area, this research integrated
estimations of delays in travel time by applying the Bureau of Public Roads (BPR) function.
Optimization in CTs may be embodied by an enormous number of problem
combinations, so the issue was resolved in this research through a metaheuristic approach,
which comes in several types, such as genetic algorithms, tabu search, simulated annealing,
and swarm-based algorithms. Swarm-based algorithms are grounded in the natural
behaviorsof swarm entities, such as a flock of birds[i.e., particle swarm optimization (PSO)]
and a colony of glowworms [i.e., glowworm swarm optimization (GSO)]. Because of the
excellent performance of these algorithms, they have been widely used in solving various
optimization problems. However, to the best of our knowledge, little research has been
devoted to the performance comparison of swarm-based algorithms intended to address
the CT optimization problem, specifically the stochastic type. To fill this void, the present
study evaluated the effectiveness of these algorithms in enhancing the design of CT
facilities. The comparison revolved specifically around the latest variants of PSO and a
version of GSO within the framework of a binary optimization problem.
The rest of the paper is organized as follows. Section 2 describes CT operations and
discusses the optimization modeling framework. Section 3 elaborates on swarm-based
algorithms and presents the case study on the performance of these approaches. Section 4
concludes the paper with a summary.
2. Optimization Modeling Framework
In formulating a design of CT facilities, this work considered minimizing total passage
time because in practice, time-related parameters serve as primary indicators of CT
performance (e.g., Yun and Choi, 1999; Cartenì and Luca, 2012; Cimpeanu et al., 2017). Total
passage time is defined as the time elapsed before shipment arrival at a container yard after
handling by QCs.
CT operations involve uncertainty issues that stem from variations in demand- and
supply-related parameters, and these issues are acted on to a limited extent by
deterministic optimizations. This is where the potential of stochastic optimization comes
into play as it incorporates uncertainty modeling explicitly into the optimization process.
Stochastic optimization therefore enables researchers to elucidate uncertainties through
probabilistic interpretations. Efforts have been exerted to integrate matters of uncertainty
in explorations of multimodal transportation (e.g., Andersen et al., 2009; Sim et al., 2009;
3. 376 A Comparative Study on Swarm-based Algorithms to Solve the Stochastic Optimization
Problem in Container Terminal Design
Hoff et al., 2010; Frazila and Zukhruf, 2017), but scant attention has been paid to such an
incorporation in the case of CT operations. The stochastic optimization of CT design covers
decision making as regards the improvement of facilities, for which modeling involves the
use of the MC framework to discover the uncertainty parameters applicable to CT
operations. A stochastic model also integrates swarm-based techniques, namely, PSO and
GSO algorithms, which are employed to identify an optimal solution. The stochastic
optimization model established in this work is expressed in Equations 1 to 5, which reflect
the model’s similarity to deterministic optimization, except that the objective of the former
is expressed in the form of an expectation (see Equation 1).
0
E ( , )
max
y
z z Y
y Y
c
(1)
1 1 1 2 2 2
1 1
3 3 3
( , )
1 1
min , , , , ,
, ,
M M
m m m m m m g
m m
z Y
W q p n W q p n y f y
M M
W q p n y
(2)
subject to
1 2
1 1
M M
m m
m m
q q
(3)
2 3
1
M
m
m
q q
(4)
1 2 3 1 2 3
, , , , , , 0
m m m m
q q q n n n (5)
where
0
z : Total passage of time (hours) before arrival at a container yard, with no actions implemented
z : Total passage of time (hours) before arrival at a container yard, with actions implemented
y : Vector set of implemented actions
: Time value of a container (Rp./hours)
y
c : Cost incurred from implementing action y (Rp.)
1
m
W : Time required by a QC at dock m to transport a container to TTU (hours)
2
m
W : Time required by a TTU at dock m to move to a container yard (hours)
3
W : Time required by an RTGC to handle a container at a container yard (hours)
1
m
q : Quantity of containers handled by a QC at dock m in twenty-foot equivalent units (TEUs)
2
m
q : Quantity of containers handled by a TTU at dock m (TEUs)
3
q : Quantity of containers handled by an RTGC (TEUs)
p : Equipment productivity (TEUs/hour)
1
m
n : Number of available QCs at dock m
2
m
n : Number of available TTUs for servicing dock m
3
n : Number of available RTGCs
g
f : Flow of TTU at link g (TTU/hour)
M : Number of available docks at a CT
A random parameter from a space of probability (Ω, A, θ) is denoted by τ, in which E
represents an expected value. Uncertainty is illustrated by a random process, where Ω
4. Zukhruf et al. 377
denotes a set of outcomes. The outcome combination is defined as events wherein A
represents a collection of random events, and it is related to θ as the probability variable.
Given that the action for improving CT facilities intended to minimize total time should
be evaluated on the basis of investment cost, the objective function is set in such a way that
maximizes the benefit–cost ratio (BCR). Benefits define the time value of savings acquired
from the expected decrement in the total passage of time after action execution, and costs
are the investments required to implement action. The BCR has been extensively employed
in the field of transportation (e.g., Yamada et al., 2009; Yamada and Zukhruf, 2015) to
identify the economic effectiveness of improvement actions. Equation 2 explains the
processing time involved in QC conveyance to a container yard; such a period also reflects
demand uncertainty and variations in equipment productivity, which is denoted by the
random parameter τ. Equations 3 and 4 illustrate container flow conservation, and
Equation 5 shows the non-negativity constraint. As the number of equipment used in a CT
affects the productivity of facilities, its establishment is regarded as equivalent to the
execution of improvement actions. The solution techniques then generate the number of
equipment to be assigned, which is denoted by 2
m
n and 3
n .
Unloading is first modeled by randomly assigning demands on a dock. The model is
configured to consider variations in ship size and QC allocations, wherein two or three QCs
can simultaneously handle a single ship. Variations in service time are used to reflect
uncertainties in equipment productivity, and such ambiguities are subsequently used to
construct the time at which containers are expected to be moved to a TTU.
Containers are further transported by a TTU to container yard using the transport link
in a CT area. To illustrate actual conditions, this research accounted for the relationship
between the increment in trucks used and the time required for travel from a dock to a
container yard. The relationship was modeled using the BPR function (see Equation 6),
which has been extensively used to describe increasing delay due to fluctuations in traffic
flow (see, e.g., Di et al., 2014; Watling et al., 2018). Because delays may influence entire port
operations, the optimization technique should uncover the optimal number of TTUs
employed in the process.
G
g g
g
g
C
y
f
v
a
5
.
1
0
)
(
5
.
0
1 (6)
where a is the travel time of a TTU (hour), 0
g
v is the free travel time condition of link g
(hour), and g
C is the capacity of link g (TTU/hour).
The final stage of CT operations incorporates the maneuvering of an RTGC, which
handles containers at a container yard. The time spent handling a container is determined
on the basis of queuing theory.
3. Solution Techniques
Problem complexity practically determines a way to choose a technique for solving an
optimization problem. Because of its stochastic characteristics and problem size, an exact
approach is not always available for solving the problem. To address this dilemma,
researchers traditionally deploy a metaheuristic procedure, which coversthe use of swarm-
based algorithms adopted by researchers to deal with various optimization problems.
Govindan et al. (2019), for example, developed a hybrid swarm-based algorithm using PSO,
the electromagnetism-like mechanism algorithm, and artificial bee colony to optimize a bi-
objective sustainable distribution network. Yamada and Zukhruf (2015) proposed a new
variant of PSO to deal with the multimodal supply chain transport supernetwork
5. 378 A Comparative Study on Swarm-based Algorithms to Solve the Stochastic Optimization
Problem in Container Terminal Design
equilibrium problem. Other applications of swarm-based algorithms include exploring
social aware cognitive radio handovers (Anandakumar and Umamaheswari, 2018), wind
farm decision systems (Zhao et al., 2019), load balancing for long-term evolution-advanced
heterogeneous networks (Summakieh et al., 2019), and molten pool detection (Baskoro et
al., 2011). As can be seen, swarm-based algorithms have been substantially exploited to
solve numerous engineering problems, yet few such initiatives have been directed toward
transportation challenges, specifically in the CT domain, as was done in the current work.
This section explains two variants of swarm-based algorithms for CT optimization: PSO and
GSO.
PSO, which was invented by Kennedy and Eberhart (1995), was initially developed for
continuous and discrete optimization (Kennedy and Eberhart, 1995; Kennedy and
Eberhart, 1997). Its short computational time and fast convergence motivated the creation
of several discrete PSO variants, such as modified binary PSO (Shen et al., 2004), probability
discrete binary PSO (PBPSO) (Menhas et al., 2012), and modified probability discrete PSO
(MPBPSO) (Zukhruf et al., 2014). Another recently proposed version is GSO (Krishnanand
and Ghose, 2005; Krishnanand and Ghose, 2008), which was preliminarily based on the
behavior of glowworms; these insects use brightness to attract other glowworms. GSO has
been employed (e.g., Krishnanand and Ghose, 2009; Zhou et al., 2014; Li et al., 2014;
Marinaki and Marinakis, 2016), along with PSO, to address various optimization issues. For
instance, GSO was used to design a routing algorithm for wireless sensor networks (Xiuwu
et al., 2019) as well as optimize a job shop and the transportation of cranes in heavy
industries (Liu et al., 2019). PSO was employed to solve the hub location problem, which
features capacity restrictions (Özgün-Kibiroğlu et al., 2019) and a routing challenge (Chen
and Shi, 2019; Chen et al., 2019).
3.1. PSO
PSO is a metaheuristic approach composed of particles (Kennedy and Eberhart, 1995;
Kennedy and Eberhart, 1997), each characterized by a position that determines the fitness
value of a particle. Hence, particle position can be regarded as a candidate solution to the
optimization problem. Vector velocity acts as an input that updates particle position, for
which this particle’s own experiences and those of its neighbors are considered. The
experiences of the particle are represented by pbest, which reflects the best position of this
particle. The best position that is visited by any particle in a swarm (i.e., gbest) then denotes
the experiences of neighbors. PSO was first invented to address continuous problems, but
several binary PSOs have since been developed to handle discrete optimization problems.
This research tested two of the latest binary versions of PSO with respect to their
performance in addressing a stochastic discrete optimization problem.
3.1.1. PBPSO
PBPSO, which was proposed by Menhas et al. (2012), entails replacing the sigmoid
function with the probabilistic linear function. The sigmoid function in the original discrete
binary PSO (DBPSO) converts a continuous position into a binary position. A similar
concept underlies PBPSO, which has a velocity function (i.e., Equations 7–8) and a
continuous position (i.e., Equations 9–10). It is distinguished from DBPSO in that it uses the
probabilistic linear function (i.e., Equation 11) to update the binary position (i.e., Equation
12).
1 2
t t t t t t
ih ih ih ih h ih
w w e rand pbest u e rand gbest u
(7)
6. Zukhruf et al. 379
min min
min max
max max
if '
' if '
if '
t
ih
t t t
ih ih ih
t
ih
vel w vel
w w vel w vel
vel vel w
(8)
't t t
ih ih ih
x x w
(9)
min min
min max
max max
if '
' if '
if '
t
ih
t t t
ih ih ih
t
ih
prob x prob
x x prob x prob
prob prob x
(10)
min max min
t
ih ih
prob x prob prob prob
(11)
1 if 0 1
0 else
ih ih
t
ih
rand prob prob
u
(12)
In the equations above,
t
ih
w : Velocity of particle i at iteration t in the hth dimension
't
ih
w : Velocity of particle i at iteration t+1 in the hth dimension
t
ih
u : Binary position of particle i at iteration t in the hth dimension
't
ih
u : Binary position of particle i at iteration t +1 in the hth dimension
t
ih
pbest : Personal best of particle i at iteration t in the hth dimension
t
ih
gbest : Global best at iteration t in the hth dimension
: Inertia weight
1
e 2
e : Learning factors for local best and global best solutions, respectively
rand : Uniform random numbers between 0 and 1
ih
prob : Linear function falling in the range [ max
prob , min
prob ]
t
ih
x : Pseudo position of particle i at iteration t in the hth dimension
't
ih
x : Pseudo position i at iteration t +1 in the hth dimension
3.1.2. MPBPSO
A recent update to PBPSO was carried out by Zukhruf et al. (2014), who added an
updating rule on changing positions in existing PBPSO algorithms. Equations 13 to 16
define the updating rule for MPBPSO (refer as well to the general procedures in Figure 1).
Equations 13 and 14 represent the exploitation strategy for maintaining the current best
solution, and Equations 15 and 16 reflect the exploration meant to extend the search space.
if (0 ) t t
ih h
rand u gbest
(13)
if 2 1 3 t t
ih ih
rand u pbest
(14)
if 2 1 3 2 3 t
ih
rand u irand
(15)
if 2 3 1 t t
ih ih
rand u u
(16)
where irand is a binary random number (0 or 1).
3.2. GSO
The behavior of glowworms motivated Krishnanand and Ghose (2005, 2008) to design
GSO as a swarm-based technique. It incorporates the luciferin that describes the
illumination level of a glowworm, with each glowworm discovering high luciferin values
within its scope. An increase in luciferin value directly induces the attraction of glowworms
within their range. This process also denotes the range of local decisions. Luciferin is
therefore an essential variable for identifying solutions. Because GSO was initially aimed at
7. 380 A Comparative Study on Swarm-based Algorithms to Solve the Stochastic Optimization
Problem in Container Terminal Design
settling continuous problems, some revision is undoubtedly needed, specifically in terms of
position updates. This work formulated a GSO variant that addresses binary optimization
by invoking the probabilistic function, which has been successfully implemented in PSO
variants (i.e., Menhas et al., 2012; Zukhruf et al., 2014; Yamada and Zukhruf, 2015). The
procedure for executing the GSO variant is delineated as follows:
Step 1. Initial stage (t = 0)
Determine the initial values of N, iter, ρ, , , o , s min
prob , max
prob , max
r .
Set initial random position ( t
i
x ) for i = 1, 2, . . . , N.
Similarly initialize the value of luciferin ( t
i
l ) and its distance range ( t
i
r ) for each
glowworm i = 1, 2, . . . , N.
In accordance with glowworm position ( t
i
x ), calculate the Euclidean distance of
glowworms i and j ( t
ij
d1 ).
Estimate the probability of movement to a nearby glowworm for each glowworm i. This
probability is given by
t
i
N
k
t
j
t
k
t
j
t
i
t
ij
l
l
l
l
b (17)
where
, : 1 ,
t t t t t t
i i ij i i j
j N N j d r l l
are the neighbor set of i at iteration t.
Set the movement direction by considering the highest movement probability, and
renew the glowworm position on the basis of the following formula:
1
t t
j i
t t
i i t t
j j
x x
x x s
x x
(18)
in which s (>0) denotes the size of step
Step 2. Determine the glowworm binary position by following the probability function
thus:
min max min
t
ih ih
prob x prob prob prob
(19)
min max min
t
ih ih
prob x prob prob prob
(20)
1
1 if 0 1
0 else
ih ih
t
ih
rand prob prob
u
(21)
where 1 1 1 1 1 1
1 2 3
, , ,..., ,....
t t t t t t
i i i i ih iH
u u u u u u
, and rand is a random number ranging from 0 to 1.
Step 3. Calculate the glowworm’s fitness ( 1
t
i
z ), and update the luciferin using the following
equation:
1 1
(1 ) ( )
t t t
i i i
l l z u
(22)
where ρ and are constants that represent the decay and enhancement of luciferin,
respectively.
Step 4. Update the range of local decision ( t
i
r ) using
1
max
min ,max 0,
t t t
i i i
r r r o N
(23)
where rmax is the maximum value of t
i
r , and o denotes a variable that limits the number of
glowworms within the range of their scope.
8. Zukhruf et al. 381
Step 5. Update the distance and calculate the movement probability using Equation 17.
Step 6. Compute t = t + 1. Terminate the process when the criterion for stopping is satisfied;
otherwise, revisit Step 2.
Figure 1 PBPSO, MPBPSO, and GSO operations
Initialize number,
velocity, position
of particle
Calculate fitness
value of particle
Updatepersonal
best and global
best
Updatevectors of
velocity (Eq. (7))
and pseudo
position (Eq. (10))
Generate position
of particle (Eq.
(12))
Updateparticle
position by Eqs.
(13)-(16)
Change t to t +1
t > max.
iteration?
stop
start
yes
no
Initialize number,
velocity, position
of particle
Calculate fitness
value of particle
Updatepersonal
best and global
best
Updatevectors of
velocity (Eq. (7))
and pseudo
position (Eq. (10))
Generate position
of particle (Eq.
(12))
t > max.
iteration?
stop
start
yes
no
b) MPBPSO Algorithm
a) PBPSO Algorithm
Change t to t +1
Initialize number,
luciferin, distance
range, and position
Estimate moving
probability (Eq. (17))
Set glowworm
position (Eq. (18))
Updateglowworm
position by Eq.
(19) – (21)
Calculate fitness
value and update
luciferin (Eq. (22))
t > max.
iteration?
stop
start
yes
no
c) GSO Algorithm
Updatethelocal
range (Eq. (23))
Change t to t +1
9. 382 A Comparative Study on Swarm-based Algorithms to Solve the Stochastic Optimization
Problem in Container Terminal Design
4. Performance Comparison
4.1. Case Study and Optimization Problem
This section discusses the evaluation of the performance of the swarm-based
algorithms in improving the design of CT facilities within the framework of stochastic
optimization. CT operations involve the container transportation process, which begins in
vessels and ends in container yards. The design of facilities hence include decision making
on quantity assignments for TTUs and RTGCs (Figure 2). The facility characteristics
analyzed in this work, namely, the number of equipment used and the time to service a
container (Table 1), were obtained from actual data on CT operations in Indonesia (Burhani
et al., 2014). These data served as the primary input in the simulation of CT operations, for
which the data ranges (i.e., minimum, mean, and maximum values) was employed to work
out distribution under a stochastic process. In a CT, three docks are available for the
handling of vessels and the containers that they transport, and each dock has three QC units
that can be operated simultaneously. On land, the CT is equipped with 45 and 10 units of
TTUs and RTGCs, respectively. Variations in vessel type and the frequency with which they
visit each dock were configured to follow a certain distribution to represent uncertainty at
the demand side.
Figure 2 Handling process at CT
A random number was established to follow the triangular distribution that
demonstrates the stochastic condition of CT operations. The MC simulation entailed
repeatedly generating a random process to produce multiple problem scenarios. The
random process was run for 1000 event times, each representing 30 days of CT operations.
Table 1 Input variables for simulation
Variables Units Minimum Maximum Mean
Ship Capacity TEUs 500 3200 2000
Arrival Frequency Vessel/dock/day 0 3 1
Service Time of QC Minute/TEUs 2 3 2.5
TTU Travel Velocity Km/hour 10 25 15
Service Time of RTGC Minute/TEUs 5 8 7
10. Zukhruf et al. 383
Before more comprehensively discussing the optimization problem of CT design, an
important task is to present the base conditions of CT performance. As illustrated in Figure
3, the arrival and stacking of a container in a container yard entail an average of 33.63
hours. The optimization problem centers on resolving the optimal decision problem to
determine the number of equipment and equipment combinations needed (i.e., TTU and
RTGC). Given that the total passage of time is a function of equipment productivity, an
increase in equipment expectantly reduces such time. However, because an increment in
TTUs possibly increases delays, an essential step is to seek the optimal quantity of TTUs
necessary to reduce delays.
The swarm-based algorithms were used to decide on the optimal number of equipment
needed. As the objective function considers the BCR, the container value of time was set to
1.95 million Rp./TEUs per hour, and the equipment purchase costs were set to 500 million
and 1.5 million Rp./unit for TTUs and RTGCs, respectively. It was also assumed that the
pattern of demand consistently occurred within five years of operation.
Figure 3 Total passage of time before arrival at container yard under base conditions
The swarm-based algorithms represent the addition of equipment using a binary-
based representation, which accords with Equations 24 and 25:
H
h
x
n
h
m
h
h
h
m
2
2
3
1
2
2 (24)
H
h
x
n
h
h
h
12
10
10
3
2 (25)
4.2. Performance Comparison Results
The performance of the swarm algorithms was evaluated on the grounds of the
optimization results and running times that they generated because these items are the
most important concerns. The optimization result is defined as a fitness value of the
objective function, which is assessed from 10 runs on the basis of the maximum, average,
and minimum values of solutions. To ensure a fair comparison, the possible number of
solutions across all the algorithms was set to 4500, which was a value considered in
practical applications in previous optimization works (i.e., Yamada et al., 2009; Yamada and
Zukhruf, 2015). The best parameter values of GSO were preliminarily determined by
conducting parameter tuning analysis. With respect to the parameter settings of GSO, the
0%
1%
2%
3%
4%
5%
6%
7%
8%
9%
24 29 34 39 44
Probbaiity
Average Total Time (Hours)
Percentile 50% Percentile 85%
11. 384 A Comparative Study on Swarm-based Algorithms to Solve the Stochastic Optimization
Problem in Container Terminal Design
range of “N×iterations” was set to 10×450, 20×225, 30×150, and 50×90. The ranges of other
parameters were set from 0.1 to 1 for and , from 0.01 to 0.04 for , from 1 to 50 for max
r
, from 1 to 10 for o , from 0.1 to 1 for s , and from 10 to 150 for max
prob . The best parameters
identified were as follows: 20 for N, 225 for iteration, 0.5 for , 0.3 for , 0.04 for , 30 for
max
r , 6 for o , 0.2 for s , and 100 for max
prob . In terms of PBPSO and MPBPSO, parameter setting
was carried out in accordance with the results of Yamada and Zukhruf (2015), who
conducted sensitivity analysis to select the best parameter set.
Table 2 presents the findings on the performance comparison of GSO, PBPSO, and
MPBPSO. The best value results suggested that GSO generates better outcomes than those
achieved by the other swarm-based algorithms. The MPBPSO results are superior to those
produced by PBPSO, similar to what was discovered in previous research (e.g., Zukhruf et
al., 2014; Yamada and Zukhruf, 2015). As indicated in Table 2, however, all the swarm
algorithms were still confronted with a stability issue as they resolved the stochastic
optimization problem. This issue prevented them from delivering the same quality of
results in 10 runs, highlighting the need for further research. The computational times
involved in algorithmic operation were also compared on a PC with an Intel Core i5
processor, a 2.2 GHz CPU, and 16.0 GB RAM. The fastest computation was exhibited by GSO,
followed by MPBPSO. This result was driven not only by the simpler process of GSO but also
by the fact that it reached the best value at the 81st iteration (i.e., 1620 combinations
evaluated). These results lead to the conclusion that the binary version of GSO presents the
potential of the algorithm to eliminate the stochastic optimization problem, despite room
for improvement in its stability.
Table 2 Performance comparison of swarm algorithms
GSO MPBPSO PBPSO
Best 1.01 1.00 0.94
Average 0.90 0.85 0.84
Worst 0.73 0.71 0.74
Computational Time (seconds) 8,372 14,264 17,345
Figure 4 Average total time, with action implemented
On the basis of the GSO optimization results, the optimal action for improving CT
performance is the addition of 11 and five units of TTUs and RTGCs, respectively. This
measure directly reduces the total passage of time before arrival at a container yard by up
12. Zukhruf et al. 385
to 5% from existing conditions. In addition, the distribution graph in Figure 4 shows a shift
to the left-hand side, implying that a container is transported at less time than that
occurring in the base conditions.
5. Conclusion
This research investigated the performance of swarm-based algorithms in the design
of CT facilities. To this end, a new variant of binary GSO and the latest types of binary PSOs
(i.e., PBPSO and MPBPSO) were incorporated into the framework of stochastic discrete
optimization. Taking into account uncertainty issues and possible additional delays due to
increments in the number of facilities, the swarm-based algorithms were used to determine
the number of additional facilities required for CT operations. The results revealed that an
increase in the number of trucks and gantry cranes improves CT performance. The
numerical experiment showed that the binary version of GSO realizes better optimization
results and computational times than those achieved by the comparison algorithms.
However, its stability needs to be carefully considered in future works. Another essential
issue of stochastic optimization is computational time because MC simulation requires
massive repetitions, albeit the proposed algorithm can reduce this requirement
significantly. Further efforts may be needed to inquire into the development of a more
efficient algorithm.
References
Anandakumar, H., Umamaheswari, K., 2018. A Bio-inspired Swarm Intelligence Technique
for Social Aware Cognitive Radio Handovers. Computers and Electrical Engineering,
Volume 71, pp. 925–937
Andersen, J., Crainic, T.G., Christiansen, M., 2009. Service Network Design with Asset
Management: Formulations and Comparative Analyses. Transportation Research Part C:
Emerging Technologies, Volume 17(2), pp. 197–207
Baskoro, A.S., Masuda, R., Suga, Y., 2011. Comparison of Particle Swarm Optimization and
Genetic Algorithm for Molten Pool Detection in Fixed Aluminum Pipe Welding.
International Journal of Technology, Volume 2(1), pp. 74–83
Budiyanto, M.A., Huzaifi, M.H., Sirait, S.J., 2019. Estimating of CO2 Emissions in a Container
Port based on Modality Movement in the Terminal Area. International Journal of
Technology, Volume 10(8), pp. 1618–1625
Burhani, J.T., Zukhruf, F., Frazila, R.B., 2014. Port Performance Evaluation Tool based on
Microsimulation Model. MATEC Web of Conferences, Volume 101, pp. 1–5
Cartenì, A., Luca, S. De., 2012. Tactical and Strategic Planning for a Container Terminal:
Modelling Issues within a Discrete Event Simulation Approach. Simulation Modelling
Practice and Theory, Volume 21(1), pp. 123–145
Cimpeanu, R., Devine, M.T., O’Brien, C., 2017. A Simulation Model for the Management and
Expansion of Extended Port Terminal Operations. Transportation Research Part E:
Logistics and Transportation Review, Volume 98, pp. 105–131
Chen, J., Shi, J., 2019. A Multi-compartment Vehicle Routing Problem with Time Windows
for Urban Distribution – A Comparison Study on Particle Swarm Optimization
Algorithms. Computers and Industrial Engineering, Volume 133, pp. 95–106
Chen, R.M., Shen, Y.M., Hong, W.Z., 2019. Neural-like Encoding Particle Swarm Optimization
for Periodic Vehicle Routing Problems. Expert Systems with Applications, Volume 138,
pp. 112833
13. 386 A Comparative Study on Swarm-based Algorithms to Solve the Stochastic Optimization
Problem in Container Terminal Design
Di, X., He, X., Guo, X., Liu, H.X., 2014. Braess Paradox under the Boundedly Rational user
Equilibria. Transportation Research Part B: Methodological, Volume 67, pp. 86–108
Dragović, B., Tzannatos, E., Park, N.K., 2017. Simulation Modelling in Ports and Container
Terminals: Literature Overview and Analysis by Research Field, Application Area and
Tool. Flexible Services and Manufacturing Journal, Volume 29(1), pp. 4–34
Frazila, R.B., Zukhruf, F., 2017. A Stochastic Discrete Optimization Model for Multimodal
Freight Transportation Network Design. International Journal of Operations Research,
Volume 14(3), pp. 107–120
Govindan, K., Jafarian, A., Nourbakhsh, V., 2019. Designing a Sustainable Supply Chain
Network Integrated with Vehicle Routing: A Comparison of Hybrid Swarm Intelligence
Metaheuristics. Computers and Operations Research, Volume 110, pp. 220–235
Hoff, A., Lium, A.G., Løkketangen, A., Crainic, T.G., 2010. A Metaheuristic for Stochastic
Service Network Design. Journal of Heuristics, Volume 16(5), pp. 653–679
Kennedy, J., Eberhart, R.C., 1995. Particle Swarm Optimization. In: Proceedings of IEEE
International Conference on Neural Networks, Volume 4, Perth, Australia, pp. 1942–
1948
Kennedy, J., Eberhart, R.C., 1997. A Discrete Binary Version of the Particle Swarm Algorithm.
In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics
5, pp. 4104–4108
Krishnanand, K.N., Ghose, D., 2005. Detection of Multiple Source Locations using a
Glowworm Metaphor with Applications to Collective Robotics. Swarm Intelligence
symposium. In: Proceedings 2005 IEEE Swarm Intelligence Symposium, 2005, pp. 84–
91
Krishnanand, K.N., Ghose, D., 2008. Theoretical Foundations for Rendezvous of Glowworm-
Inspired Agent Swarms at Multiple Locations. Robotics and Autonomous Systems,
Volume 56(7), pp. 549–569
Krishnanand, K.N., Ghose, D., 2009. Glowworm Swarm Optimization for Simultaneous
Capture of Multiple Local Optima of Multimodal Functions. Swarm Intelligence, Volume
3(2), pp. 87–124
Li, M., Wang, X., Gong, Y, Liu, Y., Jiang, C., 2014. Binary Glowworm Swarm Optimization for
Unit Commitment. Journal of Modern Power Systems and Clean Energy, Volume 2(4), pp.
357–365
Liu, Z., Guo, S., Wang, L., 2019. Integrated Green Scheduling Optimization of Flexible Job
Shop and Crane Transportation Considering Comprehensive Energy Consumption.
Journal of Cleaner Production, Volume 211, pp. 765–786
Marinaki, M., Marinakis, Y., 2016. A Glowworm Swarm Optimization Algorithm for the
Vehicle Routing Problem with Stochastic Demands. Expert Systems with Applications,
Volume 46, pp. 145–163
Menhas, M.I., Wang, L., Fei, M., Pan, H., 2012. Comparative Performance Analysis of Various
Binary Coded PSO Algorithms in Multivariable PID Controller Design. Expert Systems
with Applications, Volume 39(4), pp. 4390–4401
Mishra, N., Roy, D., Van Ommeren, J.-K., 2017. A Stochastic Model for Interterminal
Container Transportation. Transportation Science, Volume 51(1), pp. 67–87
Özgün-Kibiroğlu, Ç., Serarslan, M.N., Topcu, Y.İ., 2019. Particle Swarm Optimization for
Uncapacitated Multiple Allocation Hub Location Problem under Congestion. Expert
Systems with Applications, Volume 119, pp. 1–19
Shen, Q., Jiang, J.H., Jiao, C.X., Shen, G.L., Yu, R.Q., 2004. Modified Particle Swarm
Optimization Algorithm for Variable Selection in MLR and PLS Modeling: QSAR Studies
14. Zukhruf et al. 387
of Antagonism of Angiotensin II Antagonists. European Journal of Pharmaceutical
Sciences, Volume 22(2–3), pp. 145–152
Sim, T., Lowe, T.J., Thomas, B.W., 2009. The Stochastic P-Hub Center Problem with Service-
Level Constraints. Computers and Operations Research, Volume 36(12), pp. 3166–3177
Summakieh, M.A., Tan, C.K., El-saleh, A.A., Chuah, T.C., 2019. Improved Load Balancing for
LTE-A Heterogeneous Networks using Particle Swarm Optimization. International
Journal of Technology, Volume 10(7), pp. 1407–1415
Watling, D.P., Rasmussen, T.K., Prato, C.G., Nielsen, O.A., 2018. Stochastic user Equilibrium
with a Bounded Choice Model. Transportation Research Part B: Methodological, Volume
114, pp. 254–280
Xiuwu, Y., Qin, L., Yong, L., Mufang, H., Ke, Z., Renrong, X., 2019. Uneven Clustering Routing
Algorithm based on Glowworm Swarm Optimization. Ad Hoc Networks, Volume 93, pp.
101923
Yamada, T., Zukhruf, F., 2015. Freight Transport Network Design using Particle Swarm
Optimisation in Supply Chain–Transport Supernetwork Equilibrium. Transportation
Research Part E: Logistics and Transportation Review 75, pp. 164–187
Yamada, T., Russ, B.F., Castro, J., Taniguchi, E., 2009. Designing Multimodal Freight
Transport Networks: A Heuristic Approach and Applications. Transportation Science,
Volume 43(2), pp. 129–143
Yun, W.Y., Choi, Y.S., 1999. Simulation Model for Container-Terminal Operation Analysis
using an Object-Oriented Approach. International Journal of Production Economics,
Volume 59(1), pp. 221–230
Zhao, X., Wang, C., Su, J., Wang, J., 2019. Research and Application based on the Swarm
Intelligence Algorithm and Artificial Intelligence for Wind Farm Decision System.
Renewable Energy, Volume 134, pp. 681–697
Zhou, Y., Lou, Q., Liu, J., 2014. Glowworm Swarm Optimization for Dispatching System of
Public Transit Vehicles. Neural Processing Letters, Volume 40, pp. 25–33
Zukhruf, F., Yamada, T., Taniguchi, E., 2014. Designing Cocoa Transport Networks using a
Supply Chain Network Equilibrium Model with the Behaviour of Freight Carriers.
Journal of Japan Society of Civil Engineers, Volume 70(5), pp. 709–722