Search results for "sales"

Evaluating temporary retail price discounts using semiparametric regression

2009

PurposeTo analyze the impact of temporary retail price discount on a consumer goods product category using semiparametric regression and considering different promotional price discount characteristics as well as brand characteristics.Design/methodology/approachA semiparametric regression model using Support Vector Machines, which aim to evaluate retailers' decisions about temporary price discounts, has been developed. The model is derived from the analysis of historical sales data, which provide precise evaluation of previous temporary price discounts periods. The model is also consistent with ample empirical evidence showing that historical retail sales data can be used to evaluate the im…

The determinants of conversion rates in SME e-commerce websites

2018

Abstract Web retailers invest significant resources to improve the proportion of website visitors that make a purchase, also known as the conversion rate. Improving this rate is particularly important to SMEs that have traditionally lagged behind larger firms as they have found it difficult to justify the significant investment involved in website development against the historical low returns associated with an online sales channel. Identifying methods that increase conversion rates reduces these perceived barriers and increases effective SME participation in the growing e-commerce sector. This paper uses 1184 observations from 6 SME websites to identify and analyse the factors, or combina…

The quality of websites and their impact on economic performance: The case of nurseries and gardening companies in the Italian 'Mezzogiorno' regions

2014

The aim of this paper is to examine the quality of websites and the entrepreneurial perception of the importance of the website to improve the business performance in nurseries and gardening companies adopting web-marketing strategies. On this purpose, the paper firstly analyses which structural features enable a potential website to be labelled as 'good'; the awareness of these aspects is pivotal to define effective web-marketing solutions. Secondly, it examines whether the plant nursery entrepreneurs perceive the company website as a tool of additional sales able to increase the firm turnover. The results show that the websites are well framed and with a well-groomed design, but lacking i…

GRASP with path relinking for the orienteering problem

2014

In this paper, we address an optimization problem resulting from the combination of the well-known travelling salesman and knapsack problems. In particular, we target the orienteering problem, originated in the context of sport, which consists of maximizing the total score associated with the vertices visited in a path within the available time. The problem, also known as the selective travelling salesman problem, is NP-hard and can be formulated as an integer linear program. Since the 1980s, several solution methods for this problem have been developed and applied to a variety of fields, particularly in routing and tourism. We propose a heuristic method—based on the Greedy Randomized Adapt…

Corrigendum to “Aggregation systems for sales forecasting” [J. Bus. Res. 68(11) (2015) 2299–2304]

2016

Aggregation systems for sales forecasting

2015

Abstract Sales forecasting consists of calculating the expected sales of a specific product or company. An important issue when dealing with sales forecasting is the calculation of the average sales, usually using the arithmetic mean or the weighted average. This study introduces new methods for calculating the average sales. These methods are two modern aggregation operators: the ordered weighted average, and the unified aggregation operator. The main advantage of this approach is the possibility to deal with uncertain and complex environments in a more complete way. The study develops some key examples through multi-person and multi-criteria techniques. The study also presents a numerical…

Towards Multilevel Ant Colony Optimisation for the Euclidean Symmetric Traveling Salesman Problem

2015

Ant Colony Optimization ACO metaheuristic is one of the best known examples of swarm intelligence systems in which researchers study the foraging behavior of bees, ants and other social insects in order to solve combinatorial optimization problems. In this paper, a multilevel Ant Colony Optimization MLV-ACO for solving the traveling salesman problem is proposed, by using a multilevel process operating in a coarse-to-fine strategy. This strategy involves recursive coarsening to create a hierarchy of increasingly smaller and coarser versions of the original problem. The heart of the approach is grouping the variables that are part of the problem into clusters, which is repeated until the size…

On Randomness and Structure in Euclidean TSP Instances: A Study With Heuristic Methods

2021

Prediction of the quality of the result provided by a specific solving method is an important factor when choosing how to solve a given problem. The more accurate the prediction, the more appropriate the decision on what to choose when several solving applications are available. In this article, we study the impact of the structure of a Traveling Salesman Problem instance on the quality of the solution when using two representative heuristics: the population-based Ant Colony Optimization (ACO) and the local search Lin-Kernighan (LK) algorithm. The quality of the result for a solving method is measured by the computation accuracy, which is expressed using the percent error between its soluti…

A note on the separation of subtour elimination constraints in elementary shortest path problems

2013

Abstract This note proposes an alternative procedure for identifying violated subtour elimination constraints (SECs) in branch-and-cut algorithms for elementary shortest path problems. The procedure is also applicable to other routing problems, such as variants of travelling salesman or shortest Hamiltonian path problems, on directed graphs. The proposed procedure is based on computing the strong components of the support graph. The procedure possesses a better worst-case time complexity than the standard way of separating SECs, which uses maximum flow algorithms, and is easier to implement.

Separating capacity constraints in the CVRP using tabu search

1998

Abstract Branch and Cut methods have shown to be very successful in the resolution of some hard combinatorial optimization problems. The success has been remarkable for the Symmetric Traveling Salesman Problem (TSP). The crucial part in the method is the cutting plane algorithm: the algorithm that looks for valid inequalities that cut off the current nonfeasible linear program (LP) solution. In turn this part relies on a good knowledge of the corresponding polyhedron and our ability to design algorithms that can identify violated valid inequalities. This paper deals with the separation of the capacity constraints for the Capacitated Vehicle Routing Problem (CVRP). Three algorithms are prese…