Vinay V. Panicker
National Institute of Technology Calicut
62 Papers
78 Citations
Vinay V. Panicker is an academic researcher from National Institute of Technology Calicut. The author has contributed to research in topics: Heuristic (computer science) & Computer science. The author has an hindex of 8, co-authored 48 publications. Previous affiliations of Vinay V. Panicker include Techno India.
Chat about Author
Papers
Design and development of a hybrid ant colony-variable neighbourhood search algorithm for a multi-depot green vehicle routing problem
TL;DR: In this paper, an ACO based meta-heuristic is developed for solving both small scale and large scale problem instances in a reasonable amount of time for solving large scale instances, the performance of the proposed ACO-based meta heuristic is improved by integrating it with a variable neighbourhood search.
113
Ergonomic interventions among waste collection workers: A systematic review
TL;DR: A hierarchical framework for the implementation of ergonomic interventions in waste associated occupations is proposed, which has to be implemented based on the nature of occupational hazard considering social, cultural and economic factors.
43
Ant colony optimisation algorithm for distribution-allocation problem in a two-stage supply chain with a fixed transportation charge
TL;DR: In this paper, an ant colony optimisation is proposed to solve the distribution-allocation problem in a two-stage supply chain with a fixed transportation cost for a route, and the results obtained for the proposed algorithm have been compared with that for the genetic algorithm based heuristic currently available in the literature.
41
Development of modified discrete particle swarm optimization algorithm for quadratic assignment problems
TL;DR: A revised version of the discrete particle swarm optimization algorithm is proposed for solving Quadratic Assignment Problems (QAP), where four different possible positions are found out for each particle and the best among them is accepted as the updated position.
A mathematical model and solution methods for rail freight transportation planning in an Indian food grain supply chain
TL;DR: The research focuses on improving the allocation of railway rakes transporting food grains to a set of storage warehouses using a heuristic named optimum rake allocation algorithm, which is found to be highly efficient in terms of solution quality and computation time.