Search published articles


Showing 8 results for Sale

M. Yaghini, M. Momeni, M. Sarmadi ,
Volume 22, Issue 1 (3-2011)
Abstract

  The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, two hybrid efficient and effective metaheuristic algorithms are developed. The simulated annealing and ant colony optimization algorithms are combined with the local search methods. To evaluate the proposed algorithms, the standard problems with different sizes are used. The algorithms parameters are tuned by design of experiments approach and the most appropriate values for the parameters are adjusted. The performance of the proposed algorithms is analyzed by quality of solution and CPU time measures. The results show high efficiency and effectiveness of the proposed algorithms .


Seyed Ahmad Sheibat Alhamdi, Alireza Hosseinzadeh Kashani,
Volume 29, Issue 1 (3-2018)
Abstract

this article proposes a new algorithm for finding a good approximate set of non-dominated solutions for solving generalized traveling salesman problem. Random gravitational emulation search algorithm (RGES (is presented for solving traveling salesman problem. The algorithm based on random search concepts, and uses two parameters, speed and force of gravity in physics. The proposed algorithm is compared with genetic algorithm and experimental results show that the proposed algorithm has better performance and less runtime to be answered.
Seyyed-Mahdi Hosseini-Motlagh, Mina Nouri-Harzvili, Roza Zirakpourdehkordi,
Volume 30, Issue 3 (9-2019)
Abstract
Hanieh Adabi, Hamid Mashreghi,
Volume 30, Issue 4 (12-2019)
Abstract

In this research, we analyze a supply chain involving two competing manufacturers that sells their product through two common competing retailers. The manufacturers’ products are the same but with different brand in market. The retailers face stochastic demand where demand is a decreasing function of price with additive uncertain part. Manufacturers compete on supplying orders where retailers compete on selling price. Each manufacturer set wholesale price contract with retailers similarly. We examine supply chain coordination with wholesale price contract under competition and demand uncertainty. The analytical results show that under coordination condition, manufacturers do not obtain any positive profit and consequently the retailers intend to increase wholesale prices. On the other hand, manufacturers can increase wholesale prices until the retailers’ profit becomes zero. Hence, with a numerical study for actual cases, it is found that changing demand sensitivity and competition intensity affect the optimal decisions of ordering and pricing. Moreover, increasing in competition sensitivity, increase the supply chains’ efficiency, stocking level and selling price. The concluding remarks show that further investigation is required for possibility of coordination under competition by other contractual mechanisms.
Arezou Ghahghaei, Mehdi Seifbarghy, Davar Pishva,
Volume 32, Issue 3 (9-2021)
Abstract

This paper develops an approximate cost function for a three-echelon supply chain that has two suppliers, a central warehouse and an arbitrary number of retailers. It takes an integrated approach to multi-echelon inventory control and order-splitting problems. It assumes that all facilities apply continuous review policy for replenishment, demand at the retailers follows a Poisson process, and lead times are stochastic with no predetermined probability distribution. Unsatisfied demand is considered as lost sales at the retailers and backlogged at the warehouse and suppliers. Due to information sharing between the existing echelons, order quantity at each higher level is assumed to be an integer multiple of the lower level. Order placed by the warehouse gets divided between the two suppliers and re-order point is not restricted at the warehouse or suppliers. The main contribution of this paper is its integrated approach and the practical assumption that it uses for the order arrival sequence and the unsatisfied demands. It adds two suppliers as the third echelon to the traditional two-echelon supply chain and considers dynamic sequence of orders arrival to the warehouse at each cycle. The fact that inventory control and sourcing decisions are interdependent and act as the main challenge of supply chain management, considering them in an integrated model can significantly influence operating costs and supply chain’s efficiency. Such approach can even have greater impact when blended with practical assumptions that consider lead-time as unpredictable and unsatisfied demand as lost sales. Total cost of the three-echelon inventory system is approximated based on the average unit cost and its accuracy is assessed through simulation. Numerical results with relatively low errors confirms the accuracy of the model. It also shows how to further enhance its accuracy by either increasing the holding cost at all echelons or the penalty cost at the retailers.
Hamza Samouche, Abdellah El Barkany, Ahmed Elkhalfi,
Volume 34, Issue 2 (6-2023)
Abstract

Sales and operations planning (S&OP) is considered as an important tool at the planning strategic level. Its models vary depending on industries. The Asian model is known to be very developed. Having several parameters, the Asian model proves to be an effective tool, precisely for the study of capacity. However, after several searches made in various databases, we did not find any concrete model actually used in industry and whose parameters are presented and which defines the analysis logic to better align supply and demand. In this article, we will carry out various simulations on the basis of the data of a model of sales and operations planning used in a wire harnesses factory, in order to explain the decision-making process during S&OP meetings. The parameters of the model and the various constraints that were facing the sales and operations planning team are presented and discussed as well as the financial consequences of certain decisions. As a result of this study, we can notice that S&OP is indeed a powerful tool that makes it possible to detect in advance the various constraints whose resolution concludes in an optimal alignment between customer demand and factory capacity.
 
Malihe Masoumi, Javad Behnamian,
Volume 35, Issue 1 (3-2024)
Abstract

Due to the many applications of the travelling salesman problem, solving this problem has been considered by many researchers. One of the subsets of the travelling salesman problem is the metric travelling salesman problem in which a triangular inequality is observed. This is a crucial problem in combinatorial optimization as it is used as a standard problem as a basis for proving complexity or providing solutions to other problems in this class. The solution is used usually in logistics, manufacturing and other areas for cost minimization. Since this is an NP-hard problem, heuristic and meta-heuristic algorithms seek near-optimal solutions in polynomial time as numerical solutions. For this purpose, in this paper, a heuristic algorithm based on the minimum spanning tree is presented to solve this problem. Then, by generating 20 instances, the efficiency of the proposed algorithm was compared with one of the most famous algorithms for solving the travelling salesman problem, namely the nearest neighbour algorithm and the ant colony optimization algorithm. The results show that the proposed algorithm has good convergence to the optimal solution. In general, the proposed algorithm has a balance between runtime and the solution found compared to the other two algorithms. So the nearest neighbour algorithm has a very good runtime to reach the solution but did not have the necessary convergence to the optimal solution, and vice versa, the ant colony algorithm converges very well to the optimal solution, but, its runtime solution is very longer than the proposed algorithm.
 
La Sinaini, S Saptana, Sri Bananiek, Bungati Bungati,
Volume 35, Issue 1 (3-2024)
Abstract

Cashew nuts, a plantation commodity from Indonesia, come with a high economic value. Cashew nut processing enterprises are crucial in elevating the value added, broadening the work field, and enhancing labor absorption. This research provides an analysis of the performance and marketing strategy of micro, small, and medium enterprises (MSMEs) of cashew nut processing in Muna. It was a case study using explorative, descriptive, and qualitative methods and involved an informant, i.e., the owner of CV Hukasari Semesta. Results demonstrated that CV Hukasari Semesta contributed to the household economic sector, especially in espousing the cashew nut supply chain, which consisted of cashew nut farmers as the key material suppliers, village collecting traders, transport workers, transportation entrepreneurs, processing workers, and store employees. In operating the cashew nut processing business, parties concerned applied strategies for staple ingredient procurement, processing process, management, packaging, capital procurement, more labor recruitment, processing technology procurement, product innovation by varying product packaging and flavors, market network expansion by distributing products to supermarkets and retailers, and market segmentation. Additionally, among the marketing strategies to escalate cashew nut processing MSMEs in Muna were improving product innovation by developing more attractive product packaging based on national standards, carrying out well-planned branding, developing digital-based product information and marketing systems, honing processing and marketing labor skills, increasing processing industrial tool technology, and bolstering business capital.


Page 1 from 1