A colored traveling salesman problem (CTSP) is a generalization of the well-known multiple problem. This paper investigate class CTSP, called serial CTSP (S-CTSP). Each its salesmen has his exclusive cities and shares some with neighbor(s) in manner. It can be used to model scheduling multimachine engineering systems linearly arranged machines. S-CTSP NP-hard. Developing effective efficient approaches important enable industrial applications. presents population-based incremental learning...

A colored traveling salesman problem (CTSP) is a generalization of the well-known multiple problem. In our prior CTSP, each allocated particular color and city, carrying 1, 2, or all salesmen's colors depending on types, allows any salesmen with same to visit exactly once. This paper presents more common in which city are diverse, i.e., has one while other elements keeps unchanged. It existing CTSPs, radial serial ones, can be used model scheduling problems different accessibility jobs...

To provide accurate capacity and functionality needed for each demand period (DP), a reconfigurable manufacturing system (RMS) is able to change its configuration with time. For the RMS multi-part flow line that concurrently produces multiple parts within same family, cost delivery time are dependent on relating scheduling any DP. So far, study solution method integrated optimisation problem of design scarce. efficiently find solutions tradeoffs between total tardiness, multi-objective...

To facilitate the configuration selection of reconfigurable manufacturing systems (RMS) at beginning every demand period, it needs to generate K (predefined number) best configurations as candidates. This paper presents a GA-based approach for optimising multi-part flow-line (MPFL) RMS part family. The parameters MPFL comprise number workstations, paralleling machines and machine type well assigned operation setups (OSs) each workstation. Input requirements include an precedence graph part,...

A reconfigurable manufacturing system can evolve its configuration to offer exactly the capacity and functionality needed for every demand period. For with multi-part flow-line simultaneously producing multiple parts within same family, production cost delivery time are closely related corresponding scheduling certain Although studies on design abundant, concurrent optimization of scarce. First, a generic mixed integer nonlinear programming model is established relax limitation existing...

Operation sequencing is one of crucial tasks for process planning in a CAPP system. In this study, novel discrete particle swarm optimisation (DPSO) named feasible sequence oriented DPSO (FSDPSO) proposed to solve the operation problems CAPP. To identify plan with lowest machining cost efficiently, FSDPSO only searches sequences (FOSs) satisfying precedence constraints. FSDPSO, represents FOS as permutation directly and crossover-based updating mechanism developed evolve particles solution...

To facilitate the configuration selection of reconfigurable manufacturing systems, it needs to generate K (predefined number) best configurations as candidates for a given demand period. This paper presents systematic approach problem generating single-product flow-line (SPFL) configurations. The is determine SPFL configuration's parameters including number workstations, paralleling machines and machine type well assigned operations each workstation. Given an operation precedence graph (PG)...

Abstract Optimisation of fixture layout is critical to reduce geometric and form error the workpiece during machining process. In this paper optimal placement elements (locator clamp locations) under dynamic conditions investigated using evolutionary techniques. The application newly developed particle swarm optimisation (PSO) algorithm widely used genetic (GA) presented minimise elastic deformation considering its response. To improve performances GA PSO, an improved (IGA) obtained by basic...

Purpose The cost-oriented robotic assembly line balancing problem (cRALBP) has practical importance in real-life manufacturing scenarios. However, only a few studies tackle the cRALBP using exact methods or metaheuristics. This paper aims to propose hybrid particle swarm optimization (PSO) combined with dynamic programming (DPPSO) solve type-I. Design/methodology/approach Two different encoding schemes are presented for comparison. In frequently used Scheme 1, full of task permutations and...

Optimization of agri-food supply chain network (ASCN) is critical to reduce the sum production cost and transportation cost. A mixed integer programming (MIP) model presented handle facility location capacity selection as well choice mode for ASCN design (ASCND) problem. Due complexity optimization problem, a hybrid particle swarm (PSO) approach proposed. To facilitate finding optimal binary decision variables, reduced variable neighborhood local search embedded into PSO enhance...

Motivated by observing the importance of logistics cost in structure some products, this paper aims at multi-objective optimization integrating supply chain network design with selection transportation modes (TMs) for a single-product four-echelon composed suppliers, production plants, distribution centers (DCs) and customer zones. The key decisions are number, capacity location plants DCs, flow products through network, TMs each path. A bi-objective mixed integer linear programming model is...

Optimization of fixture layout (locator and clamp locations) is critical to reduce geometric error the workpiece during machining process. In this paper, application particle swarm optimization (PSO) algorithm presented minimize deformation in region. A PSO based approach developed optimize through integrating ANSYS parametric design language (APDL) finite element analysis compute objective function for a given layout. Particle library used decrease total computation time. The computational...

This study integrates corporate social responsibility (CSR) and channel coordination in a supply chain (SC) under random yield demand. In the SC, supplier with determines wholesale price production input, producer CSR decides order quantity investment facing CSR-related For centralized SCs without CSR, we prove unimodality of expected profits for generic demand, show uniqueness optimal ratio to input quantity. We disclose that profit SC is larger than difference increases effort yield. also...

To solve the assembly line balancing problem of type 1 (ALBP-I), a hybrid particle swarm algorithm (HPSA) is presented through incorporating reduced variable neighborhood search (RVNS) into discrete PSA (DPSA) previously developed by author. In order to enhance explorability and facilitate finding global optimum, RVNS utilized perform local within neighbors best gBest at each generation. The HPSA tested on set problems taken from literature compared with existing DPSA continuous (CPSA)....

The configurations of reconfigurable manufacturing systems (RMS) change with time to provide functionality and capacity needed for every demand period. This paper presents a novel model optimizing period cost (fixed plus operating) RMS flow-line configurations. being considered include arrangement machines (number stages number parallel per stage), equipment selection operations assignment. Input requirements consist an operation sequence, machine options each in this sequence capabilities...